import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int b1 = scanner.nextInt();
        int b2 = scanner.nextInt();
        int b3 = scanner.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int b1 = scanner.nextInt();
        int b2 = scanner.nextInt();
        int b3 = scanner.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] heights = new int[n + 1];
            for (int i = 0; i < n + 1; i++) {
                heights[i] = sc.nextInt();
            }

            for (int remove = 0; remove < n + 1; remove++) {
                List<Integer> remaining = new ArrayList<>();
                for (int i = 0; i < n + 1; i++) {
                    if (i != remove) {
                        remaining.add(heights[i]);
                    }
                }

                Collections.sort(remaining);

                boolean isArithmetic = true;
                int diff = remaining.get(1) - remaining.get(0);
                for (int i = 2; i < remaining.size(); i++) {
                    if (remaining.get(i) - remaining.get(i-1) != diff) {
                        isArithmetic = false;
                        break;
                    }
                }

                if (isArithmetic) {
                    System.out.println(heights[remove]);
                    break;
                }
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] heights = new int[n + 1];
            for (int i = 0; i < n + 1; i++) {
                heights[i] = sc.nextInt();
            }

            for (int remove = 0; remove < n + 1; remove++) {
                List<Integer> remaining = new ArrayList<>();
                for (int i = 0; i < n + 1; i++) {
                    if (i != remove) {
                        remaining.add(heights[i]);
                    }
                }

                Collections.sort(remaining);

                boolean isArithmetic = true;
                int diff = remaining.get(1) - remaining.get(0);
                for (int i = 2; i < remaining.size(); i++) {
                    if (remaining.get(i) - remaining.get(i-1) != diff) {
                        isArithmetic = false;
                        break;
                    }
                }

                if (isArithmetic) {
                    System.out.println(heights[remove]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int max = sc.nextInt();
            int min = sc.nextInt();
            System.out.println(max - min);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int max = sc.nextInt();
            int min = sc.nextInt();
            System.out.println(max - min);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] board = new int[N + 1];
            for (int i = 1; i <= N; i++) {
                board[i] = sc.nextInt();
            }

            int[] dice = new int[M + 1];
            for (int i = 1; i <= M; i++) {
                dice[i] = sc.nextInt();
            }

            int position = 1;
            int rolls = 0;

            while (position < N) {
                rolls++;
                position += dice[rolls];

                if (position >= N) break;

                position += board[position];

                if (position < 1) position = 1;
            }

            System.out.println(rolls);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] board = new int[N + 1];
            for (int i = 1; i <= N; i++) {
                board[i] = sc.nextInt();
            }

            int[] dice = new int[M + 1];
            for (int i = 1; i <= M; i++) {
                dice[i] = sc.nextInt();
            }

            int position = 1;
            int rolls = 0;

            while (position < N) {
                rolls++;
                position += dice[rolls];

                if (position >= N) break;

                position += board[position];
                if (position < 1) position = 1;
            }

            System.out.println(rolls);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;
        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;
            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Ring {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;
        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;
            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Ring {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[M][N];
        for (int i = 0; i < M; i++) {
            String line = sc.next();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        int[][][] prefix = new int[3][M + 1][N + 1];

        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= N; j++) {
                char terrain = grid[i - 1][j - 1];

                for (int t = 0; t < 3; t++) {
                    prefix[t][i][j] = prefix[t][i - 1][j] + prefix[t][i][j - 1] - prefix[t][i - 1][j - 1];
                }

                if (terrain == 'J') {
                    prefix[0][i][j]++;
                } else if (terrain == 'O') {
                    prefix[1][i][j]++;
                } else if (terrain == 'I') {
                    prefix[2][i][j]++;
                }
            }
        }

        for (int q = 0; q < K; q++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();

            int[] counts = new int[3];
            for (int t = 0; t < 3; t++) {
                counts[t] = prefix[t][c][d] - prefix[t][a - 1][d] - prefix[t][c][b - 1] + prefix[t][a - 1][b - 1];
            }

            System.out.println(counts[0] + " " + counts[1] + " " + counts[2]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[M][N];
        for (int i = 0; i < M; i++) {
            String line = sc.next();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        int[][][] prefix = new int[3][M + 1][N + 1];

        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= N; j++) {
                char terrain = grid[i - 1][j - 1];

                for (int t = 0; t < 3; t++) {
                    prefix[t][i][j] = prefix[t][i - 1][j] + prefix[t][i][j - 1] - prefix[t][i - 1][j - 1];
                }

                if (terrain == 'J') {
                    prefix[0][i][j]++;
                } else if (terrain == 'O') {
                    prefix[1][i][j]++;
                } else if (terrain == 'I') {
                    prefix[2][i][j]++;
                }
            }
        }

        for (int q = 0; q < K; q++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();

            int[] counts = new int[3];
            for (int t = 0; t < 3; t++) {
                counts[t] = prefix[t][c][d] - prefix[t][a - 1][d] - prefix[t][c][b - 1] + prefix[t][a - 1][b - 1];
            }

            System.out.println(counts[0] + " " + counts[1] + " " + counts[2]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();
        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] numbers = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                numbers[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            int totalScore = 0;

            for (int game = 0; game < 3; game++) {
                int playerNumber = numbers[i][game];
                boolean isUnique = true;

                for (int j = 0; j < n; j++) {
                    if (i != j && numbers[j][game] == playerNumber) {
                        isUnique = false;
                        break;
                    }
                }

                if (isUnique) {
                    totalScore += playerNumber;
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] numbers = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                numbers[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            int totalScore = 0;

            for (int game = 0; game < 3; game++) {
                int playerNumber = numbers[i][game];
                boolean isUnique = true;

                for (int j = 0; j < n; j++) {
                    if (i != j && numbers[j][game] == playerNumber) {
                        isUnique = false;
                        break;
                    }
                }

                if (isUnique) {
                    totalScore += playerNumber;
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] players = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                players[i][j] = sc.nextInt();
            }
        }

        for (int game = 0; game < 3; game++) {
            Map<Integer, Integer> count = new HashMap<>();

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                count.put(num, count.getOrDefault(num, 0) + 1);
            }

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                if (count.get(num) == 1) {
                    players[i][game] = num;
                } else {
                    players[i][game] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int total = players[i][0] + players[i][1] + players[i][2];
            System.out.println(total);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] players = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                players[i][j] = sc.nextInt();
            }
        }

        for (int game = 0; game < 3; game++) {
            Map<Integer, Integer> count = new HashMap<>();

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                count.put(num, count.getOrDefault(num, 0) + 1);
            }

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                if (count.get(num) == 1) {
                    players[i][game] = num;
                } else {
                    players[i][game] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int total = players[i][0] + players[i][1] + players[i][2];
            System.out.println(total);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean valid = true;
                for (int j = 0; j < m; j++) {
                    int pos = start + j * interval;
                    if (board.charAt(pos) != target.charAt(j)) {
                        valid = false;
                        break;
                    }
                }
                if (valid) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean valid = true;
                for (int j = 0; j < m; j++) {
                    int pos = start + j * interval;
                    if (board.charAt(pos) != target.charAt(j)) {
                        valid = false;
                        break;
                    }
                }
                if (valid) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int totalTriangles = 0;
        int rightTriangles = 0;
        int acuteTriangles = 0;
        int obtuseTriangles = 0;

        while (sc.hasNextLine()) {
            String line = sc.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            if (parts.length != 3) break;

            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);
            int c = Integer.parseInt(parts[2]);

            if (a > b) { int temp = a; a = b; b = temp; }
            if (b > c) { int temp = b; b = c; c = temp; }
            if (a > b) { int temp = a; a = b; b = temp; }

            if (a + b <= c) {
                System.out.println(totalTriangles + " " + rightTriangles + " " + acuteTriangles + " " + obtuseTriangles);
                break;
            }

            totalTriangles++;

            int a2 = a * a;
            int b2 = b * b;
            int c2 = c * c;

            if (a2 + b2 == c2) {
                rightTriangles++;
            } else if (a2 + b2 > c2) {
                acuteTriangles++;
            } else {
                obtuseTriangles++;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int totalTriangles = 0;
        int rightTriangles = 0;
        int acuteTriangles = 0;
        int obtuseTriangles = 0;

        while (sc.hasNextLine()) {
            String line = sc.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            if (parts.length != 3) break;

            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);
            int c = Integer.parseInt(parts[2]);

            if (a > b) { int temp = a; a = b; b = temp; }
            if (b > c) { int temp = b; b = c; c = temp; }
            if (a > b) { int temp = a; a = b; b = temp; }

            if (a + b <= c) {
                System.out.println(totalTriangles + " " + rightTriangles + " " + acuteTriangles + " " + obtuseTriangles);
                break;
            }

            totalTriangles++;

            int a2 = a * a;
            int b2 = b * b;
            int c2 = c * c;

            if (a2 + b2 == c2) {
                rightTriangles++;
            } else if (a2 + b2 > c2) {
                acuteTriangles++;
            } else {
                obtuseTriangles++;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] numbers = new int[n];

        for (int i = 0; i < n; i++) {
            numbers[i] = sc.nextInt();
        }

        int gcd = numbers[0];
        for (int i = 1; i < n; i++) {
            gcd = gcd(gcd, numbers[i]);
        }

        List<Integer> divisors = new ArrayList<>();
        for (int i = 1; i * i <= gcd; i++) {
            if (gcd % i == 0) {
                divisors.add(i);
                if (i != gcd / i) {
                    divisors.add(gcd / i);
                }
            }
        }

        Collections.sort(divisors);
        for (int divisor : divisors) {
            System.out.println(divisor);
        }
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] numbers = new int[n];
        for (int i = 0; i < n; i++) {
            numbers[i] = sc.nextInt();
        }

        int gcd = numbers[0];
        for (int i = 1; i < n; i++) {
            gcd = gcd(gcd, numbers[i]);
        }

        List<Integer> divisors = new ArrayList<>();
        for (int i = 1; i * i <= gcd; i++) {
            if (gcd % i == 0) {
                divisors.add(i);
                if (i != gcd / i) {
                    divisors.add(gcd / i);
                }
            }
        }

        Collections.sort(divisors);
        for (int divisor : divisors) {
            System.out.println(divisor);
        }
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int currentCars = m;
        int maxCars = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            currentCars = currentCars + enter - exit;

            if (currentCars < 0) {
                System.out.println(0);
                return;
            }

            maxCars = Math.max(maxCars, currentCars);
        }

        System.out.println(maxCars);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int currentCars = m;
        int maxCars = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            currentCars = currentCars + enter - exit;

            if (currentCars < 0) {
                System.out.println(0);
                return;
            }

            maxCars = Math.max(maxCars, currentCars);
        }

        System.out.println(maxCars);
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a + b);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextInt()) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a + b);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class PairOfPrimes {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextInt()) {
            int n = sc.nextInt();
            System.out.println(countPrimePairs(n));
        }

        sc.close();
    }

    static int countPrimePairs(int n) {
        boolean[] isPrime = sieveOfEratosthenes(n);
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int paired = n + 1 - i;
            if (isPrime[i] && isPrime[paired]) {
                count++;
            }
        }

        return count;
    }

    static boolean[] sieveOfEratosthenes(int n) {
        boolean[] isPrime = new boolean[n + 1];

        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        return isPrime;
    }
}

import java.util.Scanner;

public class PairOfPrimes {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextInt()) {
            int n = sc.nextInt();
            System.out.println(countPrimePairs(n));
        }

        sc.close();
    }

    static int countPrimePairs(int n) {
        boolean[] isPrime = sieveOfEratosthenes(n);
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int paired = n + 1 - i;
            if (isPrime[i] && isPrime[paired]) {
                count++;
            }
        }

        return count;
    }

    static boolean[] sieveOfEratosthenes(int n) {
        boolean[] isPrime = new boolean[n + 1];

        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        return isPrime;
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMin = new int[n];
            for (int i = 0; i < n; i++) {
                rowMin[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMin[i]) {
                        rowMin[i] = matrix[i][j];
                    }
                }
            }

            int[] colMax = new int[n];
            for (int j = 0; j < n; j++) {
                colMax[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMax[j]) {
                        colMax[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMin = new int[n];
            for (int i = 0; i < n; i++) {
                rowMin[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMin[i]) {
                        rowMin[i] = matrix[i][j];
                    }
                }
            }

            int[] colMax = new int[n];
            for (int j = 0; j < n; j++) {
                colMax[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMax[j]) {
                        colMax[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;

            for (int sum = 0; sum < 2 * n - 1; sum++) {
                if (sum % 2 == 0) {
                    for (int i = Math.min(sum, n - 1); i >= Math.max(0, sum - n + 1); i--) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                } else {
                    for (int i = Math.max(0, sum - n + 1); i <= Math.min(sum, n - 1); i++) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }

            caseNum++;
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;

            for (int sum = 0; sum < 2 * n - 1; sum++) {
                if (sum % 2 == 0) {
                    for (int i = Math.min(sum, n - 1); i >= Math.max(0, sum - n + 1); i--) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                } else {
                    for (int i = Math.max(0, sum - n + 1); i <= Math.min(sum, n - 1); i++) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;
            int row = 0, col = 0;
            boolean goingUp = true;

            for (int i = 0; i < n * n; i++) {
                matrix[row][col] = count++;

                if (goingUp) {
                    if (row == 0 || col == n - 1) {
                        goingUp = false;
                        if (col == n - 1) {
                            row++;
                        } else {
                            col++;
                        }
                    } else {
                        row--;
                        col++;
                    }
                } else {
                    if (col == 0 || row == n - 1) {
                        goingUp = true;
                        if (row == n - 1) {
                            col++;
                        } else {
                            row++;
                        }
                    } else {
                        row++;
                        col--;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;
            int row = 0, col = 0;
            boolean goingUp = true;

            for (int i = 0; i < n * n; i++) {
                matrix[row][col] = count++;

                if (goingUp) {
                    if (row == 0 || col == n - 1) {
                        goingUp = false;
                        if (col == n - 1) {
                            row++;
                        } else {
                            col++;
                        }
                    } else {
                        row--;
                        col++;
                    }
                } else {
                    if (col == 0 || row == n - 1) {
                        goingUp = true;
                        if (row == n - 1) {
                            col++;
                        } else {
                            row++;
                        }
                    } else {
                        row++;
                        col--;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);

            System.out.println(gcd(a, b));
        }

        scanner.close();
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);

            System.out.println(gcd(a, b));
        }

        scanner.close();
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += sc.nextInt();
            }

            System.out.println(totalHits);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += sc.nextInt();
            }

            System.out.println(totalHits);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(Scanner.class);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine();
            if (line.equals("END OF INPUT")) {
                break;
            }

            String[] words = line.split(" ", -1);
            StringBuilder result = new StringBuilder();

            for (String word : words) {
                result.append(word.length());
            }

            System.out.println(result.toString());
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(Scanner.class);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine();
            if (line.equals("END OF INPUT")) {
                break;
            }

            String[] words = line.split(" ", -1);
            StringBuilder result = new StringBuilder();

            for (String word : words) {
                result.append(word.length());
            }

            System.out.println(result.toString());
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = scanner.nextInt();
                y[i] = scanner.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f\n", caseNumber, area);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = scanner.nextInt();
                y[i] = scanner.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f\n", caseNumber, area);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            System.out.println(largestRectangle(grid));
        }
    }

    static int largestRectangle(int[][] grid) {
        int maxArea = 0;
        int[][] heights = new int[5][5];

        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 5; j++) {
                if (grid[i][j] == 1) {
                    heights[i][j] = (i == 0) ? 1 : heights[i-1][j] + 1;
                } else {
                    heights[i][j] = 0;
                }
            }
        }

        for (int i = 0; i < 5; i++) {
            maxArea = Math.max(maxArea, largestRectangleInHistogram(heights[i]));
        }

        return maxArea;
    }

    static int largestRectangleInHistogram(int[] heights) {
        Stack<Integer> stack = new Stack<>();
        int maxArea = 0;

        for (int i = 0; i <= heights.length; i++) {
            int h = (i == heights.length) ? 0 : heights[i];

            while (!stack.isEmpty() && h < heights[stack.peek()]) {
                int height = heights[stack.pop()];
                int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                maxArea = Math.max(maxArea, height * width);
            }
            stack.push(i);
        }

        return maxArea;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            System.out.println(largestRectangle(grid));
        }
    }

    static int largestRectangle(int[][] grid) {
        int maxArea = 0;
        int[][] heights = new int[5][5];

        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 5; j++) {
                if (grid[i][j] == 1) {
                    heights[i][j] = (i == 0) ? 1 : heights[i-1][j] + 1;
                } else {
                    heights[i][j] = 0;
                }
            }
        }

        for (int i = 0; i < 5; i++) {
            maxArea = Math.max(maxArea, largestRectangleInHistogram(heights[i]));
        }

        return maxArea;
    }

    static int largestRectangleInHistogram(int[] heights) {
        Stack<Integer> stack = new Stack<>();
        int maxArea = 0;

        for (int i = 0; i <= heights.length; i++) {
            int h = (i == heights.length) ? 0 : heights[i];

            while (!stack.isEmpty() && h < heights[stack.peek()]) {
                int height = heights[stack.pop()];
                int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                maxArea = Math.max(maxArea, height * width);
            }
            stack.push(i);
        }

        return maxArea;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            int maxArea = 0;

            for (int r1 = 0; r1 < 5; r1++) {
                for (int c1 = 0; c1 < 5; c1++) {
                    for (int r2 = r1; r2 < 5; r2++) {
                        for (int c2 = c1; c2 < 5; c2++) {
                            boolean valid = true;
                            int area = 0;

                            for (int i = r1; i <= r2 && valid; i++) {
                                for (int j = c1; j <= c2 && valid; j++) {
                                    if (grid[i][j] == 0) {
                                        valid = false;
                                    } else {
                                        area++;
                                    }
                                }
                            }

                            if (valid) {
                                maxArea = Math.max(maxArea, area);
                            }
                        }
                    }
                }
            }

            System.out.println(maxArea);
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            int maxArea = 0;

            for (int r1 = 0; r1 < 5; r1++) {
                for (int c1 = 0; c1 < 5; c1++) {
                    for (int r2 = r1; r2 < 5; r2++) {
                        for (int c2 = c1; c2 < 5; c2++) {
                            boolean valid = true;
                            int area = 0;

                            for (int i = r1; i <= r2 && valid; i++) {
                                for (int j = c1; j <= c2 && valid; j++) {
                                    if (grid[i][j] == 0) {
                                        valid = false;
                                    } else {
                                        area++;
                                    }
                                }
                            }

                            if (valid) {
                                maxArea = Math.max(maxArea, area);
                            }
                        }
                    }
                }
            }

            System.out.println(maxArea);
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        for (int cave = 0; cave < N; cave++) {
            int x = 0, y = 0;
            int maxDist = 0;
            int treasureX = 0, treasureY = 0;

            while (true) {
                int dx = sc.nextInt();
                int dy = sc.nextInt();

                if (dx == 0 && dy == 0) break;

                x += dx;
                y += dy;

                int distSq = x * x + y * y;

                if (distSq > maxDist || (distSq == maxDist && x > treasureX)) {
                    maxDist = distSq;
                    treasureX = x;
                    treasureY = y;
                }
            }

            System.out.println(treasureX + " " + treasureY);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        for (int cave = 0; cave < N; cave++) {
            int x = 0, y = 0;
            int maxDist = 0;
            int treasureX = 0, treasureY = 0;

            while (true) {
                int dx = sc.nextInt();
                int dy = sc.nextInt();

                if (dx == 0 && dy == 0) break;

                x += dx;
                y += dy;

                int distSq = x * x + y * y;

                if (distSq > maxDist || (distSq == maxDist && x > treasureX)) {
                    maxDist = distSq;
                    treasureX = x;
                    treasureY = y;
                }
            }

            System.out.println(treasureX + " " + treasureY);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static int W, H;
    static char[][] matrix;
    static String maxNumber = "0";

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            W = sc.nextInt();
            H = sc.nextInt();

            if (W == 0 && H == 0) break;

            matrix = new char[H][W];
            for (int i = 0; i < H; i++) {
                String line = sc.next();
                for (int j = 0; j < W; j++) {
                    matrix[i][j] = line.charAt(j);
                }
            }

            maxNumber = "0";

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (Character.isDigit(matrix[i][j])) {
                        dfs(i, j, "");
                    }
                }
            }

            System.out.println(maxNumber);
        }
    }

    static void dfs(int row, int col, String current) {
        if (row < 0 || row >= H || col < 0 || col >= W) return;
        if (!Character.isDigit(matrix[row][col])) return;

        current += matrix[row][col];

        if (isLarger(current, maxNumber)) {
            maxNumber = current;
        }

        dfs(row, col + 1, current);

        dfs(row + 1, col, current);
    }

    static boolean isLarger(String a, String b) {
        a = removeLeadingZeros(a);
        b = removeLeadingZeros(b);

        if (a.length() != b.length()) {
            return a.length() > b.length();
        }

        return a.compareTo(b) > 0;
    }

    static String removeLeadingZeros(String s) {
        int i = 0;
        while (i < s.length() - 1 && s.charAt(i) == '0') {
            i++;
        }
        return s.substring(i);
    }
}

import java.util.*;

public class Main {
    static int W, H;
    static char[][] matrix;
    static String maxNumber = "0";

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            W = sc.nextInt();
            H = sc.nextInt();
            if (W == 0 && H == 0) break;

            matrix = new char[H][W];
            for (int i = 0; i < H; i++) {
                String line = sc.next();
                for (int j = 0; j < W; j++) {
                    matrix[i][j] = line.charAt(j);
                }
            }

            maxNumber = "0";

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (Character.isDigit(matrix[i][j])) {
                        dfs(i, j, "");
                    }
                }
            }

            System.out.println(maxNumber);
        }
    }

    static void dfs(int row, int col, String current) {
        if (row < 0 || row >= H || col < 0 || col >= W) return;
        if (!Character.isDigit(matrix[row][col])) return;

        current += matrix[row][col];

        if (isLarger(current, maxNumber)) {
            maxNumber = current;
        }

        dfs(row, col + 1, current);

        dfs(row + 1, col, current);
    }

    static boolean isLarger(String a, String b) {
        a = removeLeadingZeros(a);
        b = removeLeadingZeros(b);

        if (a.length() != b.length()) {
            return a.length() > b.length();
        }
        return a.compareTo(b) > 0;
    }

    static String removeLeadingZeros(String s) {
        int i = 0;
        while (i < s.length() - 1 && s.charAt(i) == '0') {
            i++;
        }
        return s.substring(i);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int r = sc.nextInt();

            if (n == 0 && r == 0) break;

            List<Integer> deck = new ArrayList<>();
            for (int i = 1; i <= n; i++) {
                deck.add(i);
            }

            for (int i = 0; i < r; i++) {
                int p = sc.nextInt();
                int c = sc.nextInt();

                List<Integer> cut = new ArrayList<>();
                for (int j = 0; j < c; j++) {
                    cut.add(deck.remove(p - 1));
                }

                for (int j = c - 1; j >= 0; j--) {
                    deck.add(0, cut.get(j));
                }
            }

            System.out.println(deck.get(deck.size() - 1));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int r = sc.nextInt();

            if (n == 0 && r == 0) break;

            List<Integer> deck = new ArrayList<>();
            for (int i = 1; i <= n; i++) {
                deck.add(i);
            }

            for (int i = 0; i < r; i++) {
                int p = sc.nextInt();
                int c = sc.nextInt();

                List<Integer> cut = new ArrayList<>();
                for (int j = 0; j < c; j++) {
                    cut.add(deck.remove(p - 1));
                }

                for (int j = c - 1; j >= 0; j--) {
                    deck.add(0, cut.get(j));
                }
            }

            System.out.println(deck.get(deck.size() - 1));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            int d = sc.nextInt();
            int n = sc.nextInt();

            if (a == 0 && d == 0 && n == 0) break;

            int count = 0;
            int current = a;

            while (count < n) {
                if (isPrime(current)) {
                    count++;
                    if (count == n) {
                        System.out.println(current);
                        break;
                    }
                }
                current += d;
            }
        }

        sc.close();
    }

    private static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) return false;
        }
        return true;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            int d = sc.nextInt();
            int n = sc.nextInt();

            if (a == 0 && d == 0 && n == 0) break;

            int count = 0;
            int current = a;

            while (count < n) {
                if (isPrime(current)) {
                    count++;
                    if (count == n) {
                        System.out.println(current);
                        break;
                    }
                }
                current += d;
            }
        }

        sc.close();
    }

    private static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) return false;
        }

        return true;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < m; i++) {
            String train = sc.nextLine();
            System.out.println(countConfigurations(train));
        }
    }

    static int countConfigurations(String train) {
        Set<String> configurations = new HashSet<>();
        int n = train.length();

        for (int split = 1; split < n; split++) {
            String left = train.substring(0, split);
            String right = train.substring(split);

            String leftReversed = new StringBuilder(left).reverse().toString();
            String rightReversed = new StringBuilder(right).reverse().toString();

            configurations.add(left + right);
            configurations.add(left + rightReversed);
            configurations.add(leftReversed + right);
            configurations.add(leftReversed + rightReversed);

            configurations.add(right + left);
            configurations.add(right + leftReversed);
            configurations.add(rightReversed + left);
            configurations.add(rightReversed + leftReversed);
        }

        return configurations.size();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < m; i++) {
            String train = sc.nextLine();
            System.out.println(countConfigurations(train));
        }
    }

    static int countConfigurations(String train) {
        Set<String> configurations = new HashSet<>();
        int n = train.length();

        for (int split = 1; split < n; split++) {
            String left = train.substring(0, split);
            String right = train.substring(split);

            String leftReversed = new StringBuilder(left).reverse().toString();
            String rightReversed = new StringBuilder(right).reverse().toString();

            configurations.add(left + right);
            configurations.add(left + rightReversed);
            configurations.add(leftReversed + right);
            configurations.add(leftReversed + rightReversed);
            configurations.add(right + left);
            configurations.add(right + leftReversed);
            configurations.add(rightReversed + left);
            configurations.add(rightReversed + leftReversed);
        }

        return configurations.size();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int sum = taro[i] + hanako[j];
                        if (sum < minSum) {
                            minSum = sum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int sum = taro[i] + hanako[j];
                        if (sum < minSum) {
                            minSum = sum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int currentSum = taro[i] + hanako[j];
                        if (currentSum < minSum) {
                            minSum = currentSum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int currentSum = taro[i] + hanako[j];
                        if (currentSum < minSum) {
                            minSum = currentSum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class NextMayor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean gameEnds = true;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                gameEnds = false;
                                break;
                            }
                        }
                        if (gameEnds) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class NextMayor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean gameEnds = true;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                gameEnds = false;
                                break;
                            }
                        }
                        if (gameEnds) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static boolean canPair(int blue, int red) {
        return gcd(blue, red) > 1;
    }

    static boolean dfs(int u, List<List<Integer>> graph, int[] match, boolean[] visited) {
        for (int v : graph.get(u)) {
            if (visited[v]) continue;
            visited[v] = true;

            if (match[v] == -1 || dfs(match[v], graph, match, visited)) {
                match[v] = u;
                return true;
            }
        }
        return false;
    }

    static int maxMatching(int[] blue, int[] red) {
        int m = blue.length;
        int n = red.length;

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            graph.add(new ArrayList<>());
            for (int j = 0; j < n; j++) {
                if (canPair(blue[i], red[j])) {
                    graph.get(i).add(j);
                }
            }
        }

        int[] match = new int[n];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < m; i++) {
            boolean[] visited = new boolean[n];
            if (dfs(i, graph, match, visited)) {
                result++;
            }
        }

        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int[] blue = new int[m];
            int[] red = new int[n];

            for (int i = 0; i < m; i++) {
                blue[i] = sc.nextInt();
            }

            for (int i = 0; i < n; i++) {
                red[i] = sc.nextInt();
            }

            System.out.println(maxMatching(blue, red));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static boolean canPair(int blue, int red) {
        return gcd(blue, red) > 1;
    }

    static boolean dfs(int u, List<List<Integer>> graph, int[] match, boolean[] visited) {
        for (int v : graph.get(u)) {
            if (visited[v]) continue;
            visited[v] = true;

            if (match[v] == -1 || dfs(match[v], graph, match, visited)) {
                match[v] = u;
                return true;
            }
        }
        return false;
    }

    static int maxMatching(int[] blue, int[] red) {
        int m = blue.length;
        int n = red.length;

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            graph.add(new ArrayList<>());
            for (int j = 0; j < n; j++) {
                if (canPair(blue[i], red[j])) {
                    graph.get(i).add(j);
                }
            }
        }

        int[] match = new int[n];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < m; i++) {
            boolean[] visited = new boolean[n];
            if (dfs(i, graph, match, visited)) {
                result++;
            }
        }

        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int[] blue = new int[m];
            int[] red = new int[n];

            for (int i = 0; i < m; i++) {
                blue[i] = sc.nextInt();
            }

            for (int i = 0; i < n; i++) {
                red[i] = sc.nextInt();
            }

            System.out.println(maxMatching(blue, red));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a0 = sc.nextInt();
            int L = sc.nextInt();

            if (a0 == 0 && L == 0) break;

            Map<Integer, Integer> seen = new HashMap<>();
            int current = a0;
            int index = 0;

            while (true) {
                if (seen.containsKey(current)) {
                    int j = seen.get(current);
                    System.out.println(j + " " + current + " " + (index - j));
                    break;
                }

                seen.put(current, index);
                current = nextValue(current, L);
                index++;
            }
        }

        sc.close();
    }

    private static int nextValue(int num, int L) {
        String str = String.format("%0" + L + "d", num);
        char[] digits = str.toCharArray();

        Arrays.sort(digits);
        StringBuilder minStr = new StringBuilder();
        for (char c : digits) {
            minStr.append(c);
        }
        int min = Integer.parseInt(minStr.toString());

        StringBuilder maxStr = new StringBuilder();
        for (int i = digits.length - 1; i >= 0; i--) {
            maxStr.append(digits[i]);
        }
        int max = Integer.parseInt(maxStr.toString());

        return max - min;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a0 = sc.nextInt();
            int L = sc.nextInt();

            if (a0 == 0 && L == 0) break;

            Map<Integer, Integer> seen = new HashMap<>();
            int current = a0;
            int index = 0;

            while (true) {
                if (seen.containsKey(current)) {
                    int j = seen.get(current);
                    System.out.println(j + " " + current + " " + (index - j));
                    break;
                }

                seen.put(current, index);
                current = nextValue(current, L);
                index++;
            }
        }

        sc.close();
    }

    private static int nextValue(int num, int L) {
        String str = String.format("%0" + L + "d", num);
        char[] digits = str.toCharArray();

        Arrays.sort(digits);
        StringBuilder minStr = new StringBuilder();
        for (char c : digits) {
            minStr.append(c);
        }
        int min = Integer.parseInt(minStr.toString());

        StringBuilder maxStr = new StringBuilder();
        for (int i = digits.length - 1; i >= 0; i--) {
            maxStr.append(digits[i]);
        }
        int max = Integer.parseInt(maxStr.toString());

        return max - min;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i < maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j < maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;
            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1] && isPrime[n - p1]) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i < maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j < maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1] && isPrime[n - p1]) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        boolean[] isPrime = new boolean[10001];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= 10000; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= 10000; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i <= 10000; i++) {
            if (isPrime[i]) {
                primes.add(i);
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int start = 0; start < primes.size(); start++) {
                int sum = 0;
                for (int end = start; end < primes.size(); end++) {
                    sum += primes.get(end);
                    if (sum == n) {
                        count++;
                        break;
                    } else if (sum > n) {
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        boolean[] isPrime = new boolean[10001];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= 10000; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= 10000; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i <= 10000; i++) {
            if (isPrime[i]) {
                primes.add(i);
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int start = 0; start < primes.size(); start++) {
                int sum = 0;
                for (int end = start; end < primes.size(); end++) {
                    sum += primes.get(end);
                    if (sum == n) {
                        count++;
                        break;
                    } else if (sum > n) {
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();

            if (n == 0 && m == 0 && k == 0) break;

            double[][] dp = new double[n + 1][n * m + 1];
            dp[0][0] = 1.0;

            for (int i = 1; i <= n; i++) {
                for (int j = i; j <= i * m; j++) {
                    for (int face = 1; face <= m && face <= j; face++) {
                        dp[i][j] += dp[i - 1][j - face] / m;
                    }
                }
            }

            double expected = 0.0;
            for (int sum = n; sum <= n * m; sum++) {
                int bills = Math.max(1, sum - k);
                expected += bills * dp[n][sum];
            }

            System.out.printf("%.8f\n", expected);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();

            if (n == 0 && m == 0 && k == 0) break;

            double[][] dp = new double[n + 1][n * m + 1];
            dp[0][0] = 1.0;

            for (int i = 1; i <= n; i++) {
                for (int j = i; j <= i * m; j++) {
                    for (int face = 1; face <= m && face <= j; face++) {
                        dp[i][j] += dp[i - 1][j - face] / m;
                    }
                }
            }

            double expected = 0.0;
            for (int sum = n; sum <= n * m; sum++) {
                int bills = Math.max(1, sum - k);
                expected += bills * dp[n][sum];
            }

            System.out.printf("%.8f\n", expected);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;

            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;
            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;
            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;

            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            int s = sc.nextInt();

            if (n == 0 && k == 0 && s == 0) break;

            System.out.println(countSets(n, k, s));
        }

        sc.close();
    }

    private static int countSets(int n, int k, int s) {
        int[][][] dp = new int[n + 1][k + 1][s + 1];

        for (int i = 0; i <= n; i++) {
            dp[i][0][0] = 1;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= k; j++) {
                for (int sum = 0; sum <= s; sum++) {
                    dp[i][j][sum] = dp[i-1][j][sum];

                    if (j > 0 && sum >= i) {
                        dp[i][j][sum] += dp[i-1][j-1][sum-i];
                    }
                }
            }
        }

        return dp[n][k][s];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            int s = sc.nextInt();

            if (n == 0 && k == 0 && s == 0) break;

            System.out.println(countSets(n, k, s));
        }

        sc.close();
    }

    private static int countSets(int n, int k, int s) {
        int[][][] dp = new int[n + 1][k + 1][s + 1];

        for (int i = 0; i <= n; i++) {
            dp[i][0][0] = 1;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= k; j++) {
                for (int sum = 0; sum <= s; sum++) {
                    dp[i][j][sum] = dp[i-1][j][sum];

                    if (j > 0 && sum >= i) {
                        dp[i][j][sum] += dp[i-1][j-1][sum-i];
                    }
                }
            }
        }

        return dp[n][k][s];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String expression = sc.nextLine();
        int bobAnswer = sc.nextInt();

        int multiplicationFirst = evaluateMultiplicationFirst(expression);
        int leftToRight = evaluateLeftToRight(expression);

        boolean matchesM = (multiplicationFirst == bobAnswer);
        boolean matchesL = (leftToRight == bobAnswer);

        if (matchesM && matchesL) {
            System.out.println("U");
        } else if (matchesM) {
            System.out.println("M");
        } else if (matchesL) {
            System.out.println("L");
        } else {
            System.out.println("I");
        }
    }

    private static int evaluateMultiplicationFirst(String expr) {
        String temp = expr;
        while (temp.contains("*")) {
            int pos = temp.indexOf("*");
            int left = Character.getNumericValue(temp.charAt(pos - 1));
            int right = Character.getNumericValue(temp.charAt(pos + 1));
            int result = left * right;

            String before = temp.substring(0, pos - 1);
            String after = temp.substring(pos + 2);
            temp = before + result + after;
        }

        return evaluateLeftToRight(temp);
    }

    private static int evaluateLeftToRight(String expr) {
        int result = Character.getNumericValue(expr.charAt(0));

        for (int i = 1; i < expr.length(); i += 2) {
            char operator = expr.charAt(i);
            int operand = Character.getNumericValue(expr.charAt(i + 1));

            if (operator == '+') {
                result += operand;
            } else if (operator == '*') {
                result *= operand;
            }
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String expression = sc.nextLine();
        int bobAnswer = sc.nextInt();

        int multiplicationFirst = evaluateMultiplicationFirst(expression);
        int leftToRight = evaluateLeftToRight(expression);

        boolean matchesM = (multiplicationFirst == bobAnswer);
        boolean matchesL = (leftToRight == bobAnswer);

        if (matchesM && matchesL) {
            System.out.println("U");
        } else if (matchesM) {
            System.out.println("M");
        } else if (matchesL) {
            System.out.println("L");
        } else {
            System.out.println("I");
        }
    }

    private static int evaluateMultiplicationFirst(String expr) {
        String temp = expr;
        while (temp.contains("*")) {
            int pos = temp.indexOf("*");
            int left = Character.getNumericValue(temp.charAt(pos - 1));
            int right = Character.getNumericValue(temp.charAt(pos + 1));
            int result = left * right;

            String before = temp.substring(0, pos - 1);
            String after = temp.substring(pos + 2);
            temp = before + result + after;
        }

        return evaluateLeftToRight(temp);
    }

    private static int evaluateLeftToRight(String expr) {
        int result = Character.getNumericValue(expr.charAt(0));

        for (int i = 1; i < expr.length(); i += 2) {
            char operator = expr.charAt(i);
            int operand = Character.getNumericValue(expr.charAt(i + 1));

            if (operator == '+') {
                result += operand;
            } else if (operator == '*') {
                result *= operand;
            }
        }

        return result;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];

        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        generateSubsequences(digits, 0, "", found);

        int result = 0;
        while (found.contains(result)) {
            result++;
        }

        System.out.println(result);
    }

    private static void generateSubsequences(int[] digits, int index, String current, Set<Integer> found) {
        if (!current.isEmpty()) {
            if (current.length() == 1 || current.charAt(0) != '0') {
                try {
                    int num = Integer.parseInt(current);
                    found.add(num);
                } catch (NumberFormatException e) {
                }
            } else if (current.equals("0")) {
                found.add(0);
            }
        }

        if (index >= digits.length) {
            return;
        }

        generateSubsequences(digits, index + 1, current + digits[index], found);

        generateSubsequences(digits, index + 1, current, found);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];

        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        generateSubsequences(digits, 0, "", found);

        int result = 0;
        while (found.contains(result)) {
            result++;
        }

        System.out.println(result);
    }

    private static void generateSubsequences(int[] digits, int index, String current, Set<Integer> found) {
        if (!current.isEmpty()) {
            if (current.length() == 1 || current.charAt(0) != '0') {
                try {
                    int num = Integer.parseInt(current);
                    found.add(num);
                } catch (NumberFormatException e) {
                }
            } else if (current.equals("0")) {
                found.add(0);
            }
        }

        if (index >= digits.length) {
            return;
        }

        generateSubsequences(digits, index + 1, current + digits[index], found);

        generateSubsequences(digits, index + 1, current, found);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];
        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        for (int mask = 1; mask < (1 << n); mask++) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < n; i++) {
                if ((mask & (1 << i)) != 0) {
                    sb.append(digits[i]);
                }
            }

            String numStr = sb.toString();
            if (numStr.length() > 1 && numStr.charAt(0) == '0') {
                continue;
            }

            try {
                int num = Integer.parseInt(numStr);
                found.add(num);
            } catch (NumberFormatException e) {
            }
        }

        int answer = 0;
        while (found.contains(answer)) {
            answer++;
        }

        System.out.println(answer);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];
        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        for (int mask = 1; mask < (1 << n); mask++) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < n; i++) {
                if ((mask & (1 << i)) != 0) {
                    sb.append(digits[i]);
                }
            }

            String numStr = sb.toString();
            if (numStr.length() > 1 && numStr.charAt(0) == '0') {
                continue;
            }

            try {
                int num = Integer.parseInt(numStr);
                found.add(num);
            } catch (NumberFormatException e) {
            }
        }

        int answer = 0;
        while (found.contains(answer)) {
            answer++;
        }

        System.out.println(answer);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            int maxSum = -1;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    int sum = prices[i] + prices[j];
                    if (sum <= m && sum > maxSum) {
                        maxSum = sum;
                    }
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            int maxSum = -1;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    int sum = prices[i] + prices[j];
                    if (sum <= m && sum > maxSum) {
                        maxSum = sum;
                    }
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];
                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];
                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;

            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];

                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] incomes = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                incomes[i] = scanner.nextInt();
                sum += incomes[i];
            }

            double average = (double) sum / n;
            int count = 0;

            for (int i = 0; i < n; i++) {
                if (incomes[i] <= average) {
                    count++;
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] incomes = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                incomes[i] = scanner.nextInt();
                sum += incomes[i];
            }

            double average = (double) sum / n;
            int count = 0;

            for (int i = 0; i < n; i++) {
                if (incomes[i] <= average) {
                    count++;
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<String> gems = new HashSet<>();
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                gems.add(x + "," + y);
            }

            int M = sc.nextInt();
            Set<String> visited = new HashSet<>();

            int x = 10, y = 10;
            visited.add(x + "," + y);

            for (int i = 0; i < M; i++) {
                String dir = sc.next();
                int dist = sc.nextInt();

                int dx = 0, dy = 0;
                switch (dir) {
                    case "N": dy = 1; break;
                    case "E": dx = 1; break;
                    case "S": dy = -1; break;
                    case "W": dx = -1; break;
                }

                for (int j = 0; j < dist; j++) {
                    x += dx;
                    y += dy;
                    visited.add(x + "," + y);
                }
            }

            boolean allCollected = true;
            for (String gem : gems) {
                if (!visited.contains(gem)) {
                    allCollected = false;
                    break;
                }
            }

            System.out.println(allCollected ? "Yes" : "No");
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<String> gems = new HashSet<>();
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                gems.add(x + "," + y);
            }

            int M = sc.nextInt();
            Set<String> visited = new HashSet<>();

            int x = 10, y = 10;
            visited.add(x + "," + y);

            for (int i = 0; i < M; i++) {
                String dir = sc.next();
                int dist = sc.nextInt();

                int dx = 0, dy = 0;
                switch (dir) {
                    case "N": dy = 1; break;
                    case "E": dx = 1; break;
                    case "S": dy = -1; break;
                    case "W": dx = -1; break;
                }

                for (int j = 0; j < dist; j++) {
                    x += dx;
                    y += dy;
                    visited.add(x + "," + y);
                }
            }

            boolean allCollected = true;
            for (String gem : gems) {
                if (!visited.contains(gem)) {
                    allCollected = false;
                    break;
                }
            }

            System.out.println(allCollected ? "Yes" : "No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        while (t-- > 0) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int i = 0; i < n; i++) {
                heights[i] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int i = 1; i < n; i++) {
                int diff = heights[i] - heights[i-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        while (t-- > 0) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int i = 0; i < n; i++) {
                heights[i] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int i = 1; i < n; i++) {
                int diff = heights[i] - heights[i-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            List<Packet> packets = new ArrayList<>();
            for (int i = 0; i < M; i++) {
                int t = sc.nextInt();
                int s = sc.nextInt();
                int d = sc.nextInt();
                packets.add(new Packet(t, s, d));
            }

            packets.sort((a, b) -> Integer.compare(a.time, b.time));

            Set<Integer> infected = new HashSet<>();
            infected.add(1);

            for (Packet p : packets) {
                if (infected.contains(p.source)) {
                    infected.add(p.destination);
                }
            }

            System.out.println(infected.size());
        }

        sc.close();
    }

    static class Packet {
        int time, source, destination;

        Packet(int time, int source, int destination) {
            this.time = time;
            this.source = source;
            this.destination = destination;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            List<Packet> packets = new ArrayList<>();
            for (int i = 0; i < M; i++) {
                int t = sc.nextInt();
                int s = sc.nextInt();
                int d = sc.nextInt();
                packets.add(new Packet(t, s, d));
            }

            packets.sort((a, b) -> Integer.compare(a.time, b.time));

            Set<Integer> infected = new HashSet<>();
            infected.add(1);

            for (Packet p : packets) {
                if (infected.contains(p.source)) {
                    infected.add(p.destination);
                }
            }

            System.out.println(infected.size());
        }

        sc.close();
    }

    static class Packet {
        int time, source, destination;

        Packet(int time, int source, int destination) {
            this.time = time;
            this.source = source;
            this.destination = destination;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int current = v;
                    while (!marked[current]) {
                        current = parent[current];
                    }
                    sum += current;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int current = v;
                    while (!marked[current]) {
                        current = parent[current];
                    }
                    sum += current;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();

            int count = 0;
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();

            int count = 0;
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) break;

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) break;

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) {
                break;
            }

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) {
                break;
            }

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Point {
        int x, y;
        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj instanceof Point) {
                Point p = (Point) obj;
                return x == p.x && y == p.y;
            }
            return false;
        }

        @Override
        public int hashCode() {
            return x * 1000 + y;
        }
    }

    static int[][] directions = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, -1}, {-1, 1}};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int t = sc.nextInt();
            int n = sc.nextInt();

            if (t == 0 && n == 0) break;

            Set<Point> obstacles = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                obstacles.add(new Point(x, y));
            }

            int startX = sc.nextInt();
            int startY = sc.nextInt();
            Point start = new Point(startX, startY);

            Set<Point> reachable = new HashSet<>();
            Queue<Point> queue = new LinkedList<>();
            Map<Point, Integer> distance = new HashMap<>();

            queue.offer(start);
            distance.put(start, 0);
            reachable.add(start);

            while (!queue.isEmpty()) {
                Point current = queue.poll();
                int currentDist = distance.get(current);

                if (currentDist >= t) continue;

                for (int[] dir : directions) {
                    int newX = current.x + dir[0];
                    int newY = current.y + dir[1];
                    Point next = new Point(newX, newY);

                    if (obstacles.contains(next)) continue;
                    if (distance.containsKey(next)) continue;

                    distance.put(next, currentDist + 1);
                    reachable.add(next);
                    queue.offer(next);
                }
            }

            System.out.println(reachable.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Point {
        int x, y;
        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj instanceof Point) {
                Point p = (Point) obj;
                return x == p.x && y == p.y;
            }
            return false;
        }

        @Override
        public int hashCode() {
            return x * 1000 + y;
        }
    }

    static int[][] directions = {
        {1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, -1}, {-1, 1}
    };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int t = sc.nextInt();
            int n = sc.nextInt();

            if (t == 0 && n == 0) break;

            Set<Point> obstacles = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                obstacles.add(new Point(x, y));
            }

            int startX = sc.nextInt();
            int startY = sc.nextInt();
            Point start = new Point(startX, startY);

            Set<Point> reachable = new HashSet<>();
            Queue<Point> queue = new LinkedList<>();
            Map<Point, Integer> distance = new HashMap<>();

            queue.offer(start);
            distance.put(start, 0);
            reachable.add(start);

            while (!queue.isEmpty()) {
                Point current = queue.poll();
                int currentDist = distance.get(current);

                if (currentDist >= t) continue;

                for (int[] dir : directions) {
                    int newX = current.x + dir[0];
                    int newY = current.y + dir[1];
                    Point next = new Point(newX, newY);

                    if (obstacles.contains(next)) continue;
                    if (distance.containsKey(next)) continue;

                    distance.put(next, currentDist + 1);
                    reachable.add(next);
                    queue.offer(next);
                }
            }

            System.out.println(reachable.size());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] grid = new int[H][W];
        for (int i = 0; i < H; i++) {
            String line = sc.next();
            for (int j = 0; j < W; j++) {
                grid[i][j] = line.charAt(j) - '0';
            }
        }

        int[][] dp = new int[H][W];

        dp[0][0] = grid[0][0];

        for (int j = 1; j < W; j++) {
            dp[0][j] = dp[0][j-1] + grid[0][j];
        }

        for (int i = 1; i < H; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }

        for (int i = 1; i < H; i++) {
            for (int j = 1; j < W; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }

        System.out.println(dp[H-1][W-1]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] grid = new int[H][W];
        for (int i = 0; i < H; i++) {
            String line = sc.next();
            for (int j = 0; j < W; j++) {
                grid[i][j] = line.charAt(j) - '0';
            }
        }

        int[][] dp = new int[H][W];

        dp[0][0] = grid[0][0];

        for (int j = 1; j < W; j++) {
            dp[0][j] = dp[0][j-1] + grid[0][j];
        }

        for (int i = 1; i < H; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }

        for (int i = 1; i < H; i++) {
            for (int j = 1; j < W; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }

        System.out.println(dp[H-1][W-1]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Set<Integer>> knows = new ArrayList<>();
            for (int i = 0; i <= N; i++) {
                knows.add(new HashSet<>());
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows.get(i).add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> suspects = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows.get(i).contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    suspects.add(i);
                }
            }

            if (suspects.size() == 1) {
                System.out.println(suspects.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Set<Integer>> knows = new ArrayList<>();
            for (int i = 0; i <= N; i++) {
                knows.add(new HashSet<>());
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows.get(i).add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> suspects = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows.get(i).contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    suspects.add(i);
                }
            }

            if (suspects.size() == 1) {
                System.out.println(suspects.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            long n = sc.nextLong();
            System.out.println(solve(n));
        }
    }

    static int solve(long n) {
        Set<Long> visited = new HashSet<>();
        int steps = 0;

        while (n >= 10) {
            if (visited.contains(n)) {
                return -1;
            }
            visited.add(n);

            String s = String.valueOf(n);
            long maxProduct = 0;

            for (int i = 1; i < s.length(); i++) {
                String left = s.substring(0, i);
                String right = s.substring(i);

                long leftNum = Long.parseLong(left);
                long rightNum = Long.parseLong(right);

                long product = leftNum * rightNum;
                maxProduct = Math.max(maxProduct, product);
            }

            n = maxProduct;
            steps++;
        }

        return steps;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            long n = sc.nextLong();
            System.out.println(solve(n));
        }
    }

    static int solve(long n) {
        Set<Long> visited = new HashSet<>();
        int steps = 0;

        while (n >= 10) {
            if (visited.contains(n)) {
                return -1;
            }
            visited.add(n);

            String s = String.valueOf(n);
            long maxProduct = 0;

            for (int i = 1; i < s.length(); i++) {
                String left = s.substring(0, i);
                String right = s.substring(i);

                long leftNum = Long.parseLong(left);
                long rightNum = Long.parseLong(right);
                long product = leftNum * rightNum;

                maxProduct = Math.max(maxProduct, product);
            }

            n = maxProduct;
            steps++;
        }

        return steps;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];

        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;

            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];
        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];
        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];

        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (registeredIds.contains(id)) {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            } else {
                System.out.println("Unknown " + id);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (registeredIds.contains(id)) {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            } else {
                System.out.println("Unknown " + id);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] keys = new int[n];
            for (int i = 0; i < n; i++) {
                keys[i] = sc.nextInt();
            }

            String s = sc.next();
            StringBuilder result = new StringBuilder();

            for (int i = 0; i < s.length(); i++) {
                char c = s.charAt(i);
                int key = keys[i % n];

                int pos;
                if (c >= 'a' && c <= 'z') {
                    pos = c - 'a';
                } else {
                    pos = c - 'A' + 26;
                }

                pos = (pos - key + 52) % 52;

                char newChar;
                if (pos < 26) {
                    newChar = (char)('a' + pos);
                } else {
                    newChar = (char)('A' + pos - 26);
                }

                result.append(newChar);
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] keys = new int[n];
            for (int i = 0; i < n; i++) {
                keys[i] = sc.nextInt();
            }

            String s = sc.next();
            StringBuilder result = new StringBuilder();

            for (int i = 0; i < s.length(); i++) {
                char c = s.charAt(i);
                int key = keys[i % n];

                int pos;
                if (c >= 'a' && c <= 'z') {
                    pos = c - 'a';
                } else {
                    pos = c - 'A' + 26;
                }

                pos = (pos - key + 52) % 52;

                char newChar;
                if (pos < 26) {
                    newChar = (char)('a' + pos);
                } else {
                    newChar = (char)('A' + pos - 26);
                }

                result.append(newChar);
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int cycle = a + b;

        int lcm = lcm(cycle, 60);

        for (int t = 0; t * 60 <= lcm; t++) {
            int arrivalTime = 60 * t + c;
            int timeInCycle = arrivalTime % cycle;

            if (timeInCycle <= a) {
                System.out.println(arrivalTime);
                return;
            }
        }

        System.out.println(-1);
    }

    static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static int lcm(int a, int b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int cycle = a + b;

        int lcm = lcm(cycle, 60);

        for (int t = 0; t * 60 <= lcm; t++) {
            int arrivalTime = 60 * t + c;
            int timeInCycle = arrivalTime % cycle;

            if (timeInCycle <= a) {
                System.out.println(arrivalTime);
                return;
            }
        }

        System.out.println(-1);
    }

    static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static int lcm(int a, int b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double minX = (double)(C * W0 - R0) / R;
            int X = Math.max(0, (int)Math.ceil(minX));

            System.out.println(X);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double minX = (double)(C * W0 - R0) / R;
            int X = Math.max(0, (int)Math.ceil(minX));

            System.out.println(X);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = new int[n + 1];
        for (int i = 0; i < n; i++) {
            int r = sc.nextInt();
            int c = sc.nextInt();
            if (i == 0) {
                p[0] = r;
            }
            p[i + 1] = c;
        }

        int[][] dp = new int[n][n];

        for (int l = 2; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                int j = i + l - 1;
                dp[i][j] = Integer.MAX_VALUE;
                for (int k = i; k < j; k++) {
                    int cost = dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    dp[i][j] = Math.min(dp[i][j], cost);
                }
            }
        }

        System.out.println(dp[0][n - 1]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = new int[n + 1];
        for (int i = 0; i < n; i++) {
            int r = sc.nextInt();
            int c = sc.nextInt();
            if (i == 0) {
                p[0] = r;
            }
            p[i + 1] = c;
        }

        int[][] dp = new int[n][n];

        for (int l = 2; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                int j = i + l - 1;
                dp[i][j] = Integer.MAX_VALUE;

                for (int k = i; k < j; k++) {
                    int cost = dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    dp[i][j] = Math.min(dp[i][j], cost);
                }
            }
        }

        System.out.println(dp[0][n - 1]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = scanner.nextInt() - 1;
            int k = scanner.nextInt();

            for (int j = 0; j < k; j++) {
                int v = scanner.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = scanner.nextInt() - 1;
            int k = scanner.nextInt();

            for (int j = 0; j < k; j++) {
                int v = scanner.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt() - 1;
            int k = sc.nextInt();

            for (int j = 0; j < k; j++) {
                int v = sc.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt() - 1;
            int k = sc.nextInt();

            for (int j = 0; j < k; j++) {
                int v = sc.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();
            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            uf.union(s, t);
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            if (uf.connected(s, t)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            uf.union(s, t);
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            if (uf.connected(s, t)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);
        key[0] = 0;

        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);
        key[0] = 0;

        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);

        key[0] = 0;
        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;

                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;
                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;

                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;
                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        System.out.println(gcd(a, b));
    }

    public static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        System.out.println(gcd(a, b));
    }

    public static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        System.out.println(gcd(a, b));
    }

    static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        System.out.println(gcd(a, b));
    }

    static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] tokens = sc.nextLine().split(" ");

        Stack<Integer> stack = new Stack<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] tokens = sc.nextLine().split(" ");

        Stack<Integer> stack = new Stack<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    static class Process {
        String name;
        int time;

        Process(String name, int time) {
            this.name = name;
            this.time = time;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Process> queue = new LinkedList<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();
            int time = sc.nextInt();
            queue.offer(new Process(name, time));
        }

        int currentTime = 0;

        while (!queue.isEmpty()) {
            Process current = queue.poll();

            if (current.time <= q) {
                currentTime += current.time;
                System.out.println(current.name + " " + currentTime);
            } else {
                currentTime += q;
                current.time -= q;
                queue.offer(current);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Process {
        String name;
        int time;

        Process(String name, int time) {
            this.name = name;
            this.time = time;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Process> queue = new LinkedList<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();
            int time = sc.nextInt();
            queue.offer(new Process(name, time));
        }

        int currentTime = 0;

        while (!queue.isEmpty()) {
            Process current = queue.poll();

            if (current.time <= q) {
                currentTime += current.time;
                System.out.println(current.name + " " + currentTime);
            } else {
                currentTime += q;
                current.time -= q;
                queue.offer(current);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> s = new HashSet<>();
        for (int i = 0; i < n; i++) {
            s.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (s.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> s = new HashSet<>();
        for (int i = 0; i < n; i++) {
            s.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (s.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();

        Set<String> dictionary = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String line = sc.nextLine();
            String[] parts = line.split(" ", 2);
            String command = parts[0];
            String str = parts[1];

            if (command.equals("insert")) {
                dictionary.add(str);
            } else if (command.equals("find")) {
                if (dictionary.contains(str)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();

        Set<String> dictionary = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String line = sc.nextLine();
            String[] parts = line.split(" ", 2);
            String command = parts[0];
            String str = parts[1];

            if (command.equals("insert")) {
                dictionary.add(str);
            } else if (command.equals("find")) {
                if (dictionary.contains(str)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] weights = new int[n];

        int maxWeight = 0;
        int totalWeight = 0;
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
            maxWeight = Math.max(maxWeight, weights[i]);
            totalWeight += weights[i];
        }

        int left = maxWeight;
        int right = totalWeight;
        int result = right;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (canLoad(weights, k, mid)) {
                result = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        System.out.println(result);
    }

    private static boolean canLoad(int[] weights, int k, int maxLoad) {
        int trucks = 1;
        int currentLoad = 0;

        for (int weight : weights) {
            if (currentLoad + weight <= maxLoad) {
                currentLoad += weight;
            } else {
                trucks++;
                currentLoad = weight;
                if (trucks > k) {
                    return false;
                }
            }
        }

        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] weights = new int[n];

        int maxWeight = 0;
        int totalWeight = 0;
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
            maxWeight = Math.max(maxWeight, weights[i]);
            totalWeight += weights[i];
        }

        int left = maxWeight;
        int right = totalWeight;
        int result = right;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (canLoad(weights, k, mid)) {
                result = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        System.out.println(result);
    }

    private static boolean canLoad(int[] weights, int k, int maxLoad) {
        int trucks = 1;
        int currentLoad = 0;

        for (int weight : weights) {
            if (currentLoad + weight <= maxLoad) {
                currentLoad += weight;
            } else {
                trucks++;
                currentLoad = weight;
                if (trucks > k) {
                    return false;
                }
            }
        }

        return true;
    }
}

import java.util.*;

public class Main {
    static int[] A;
    static int n;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int M = sc.nextInt();
            if (solve(0, M)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }
    }

    static boolean solve(int p, int t) {
        if (t == 0) return true;
        if (p >= n) return false;

        return solve(p + 1, t) || solve(p + 1, t - A[p]);
    }
}

import java.util.*;

public class Main {
    static int[] A;
    static int n;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int M = sc.nextInt();
            if (solve(0, M)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }
    }

    static boolean solve(int p, int t) {
        if (t == 0) return true;
        if (p >= n) return false;

        return solve(p + 1, t) || solve(p + 1, t - A[p]);
    }
}

import java.util.Scanner;

public class Main {
    private static long inversions = 0;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        mergeSort(arr, 0, n - 1);
        System.out.println(inversions);
    }

    private static void mergeSort(int[] arr, int left, int right) {
        if (left < right) {
            int mid = left + (right - left) / 2;
            mergeSort(arr, left, mid);
            mergeSort(arr, mid + 1, right);
            merge(arr, left, mid, right);
        }
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        int[] temp = new int[right - left + 1];
        int i = left, j = mid + 1, k = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                inversions += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i - left];
        }
    }
}

import java.util.Scanner;

public class Main {
    private static long inversions = 0;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        mergeSort(arr, 0, n - 1);
        System.out.println(inversions);
    }

    private static void mergeSort(int[] arr, int left, int right) {
        if (left < right) {
            int mid = left + (right - left) / 2;
            mergeSort(arr, left, mid);
            mergeSort(arr, mid + 1, right);
            merge(arr, left, mid, right);
        }
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        int[] temp = new int[right - left + 1];
        int i = left, j = mid + 1, k = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                inversions += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i - left];
        }
    }
}

import java.util.Scanner;

public class Main {
    private static long mergeAndCount(int[] arr, int[] temp, int left, int mid, int right) {
        int i = left, j = mid + 1, k = left;
        long invCount = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                invCount += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i];
        }

        return invCount;
    }

    private static long mergeSortAndCount(int[] arr, int[] temp, int left, int right) {
        long invCount = 0;
        if (left < right) {
            int mid = left + (right - left) / 2;

            invCount += mergeSortAndCount(arr, temp, left, mid);
            invCount += mergeSortAndCount(arr, temp, mid + 1, right);
            invCount += mergeAndCount(arr, temp, left, mid, right);
        }
        return invCount;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        int[] temp = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        long result = mergeSortAndCount(arr, temp, 0, n - 1);
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static long mergeAndCount(int[] arr, int[] temp, int left, int mid, int right) {
        int i = left, j = mid + 1, k = left;
        long invCount = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                invCount += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i];
        }

        return invCount;
    }

    private static long mergeSortAndCount(int[] arr, int[] temp, int left, int right) {
        long invCount = 0;
        if (left < right) {
            int mid = left + (right - left) / 2;

            invCount += mergeSortAndCount(arr, temp, left, mid);
            invCount += mergeSortAndCount(arr, temp, mid + 1, right);
            invCount += mergeAndCount(arr, temp, left, mid, right);
        }
        return invCount;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        int[] temp = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        long result = mergeSortAndCount(arr, temp, 0, n - 1);
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];
        int maxVal = 0;

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
            maxVal = Math.max(maxVal, A[i]);
        }

        int[] C = new int[maxVal + 1];
        int[] B = new int[n];

        for (int j = 0; j < n; j++) {
            C[A[j]]++;
        }

        for (int i = 1; i <= maxVal; i++) {
            C[i] = C[i] + C[i - 1];
        }

        for (int j = n - 1; j >= 0; j--) {
            B[C[A[j]] - 1] = A[j];
            C[A[j]]--;
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(B[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];
        int maxVal = 0;

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
            maxVal = Math.max(maxVal, A[i]);
        }

        int[] C = new int[maxVal + 1];
        int[] B = new int[n];

        for (int j = 0; j < n; j++) {
            C[A[j]]++;
        }

        for (int i = 1; i <= maxVal; i++) {
            C[i] = C[i] + C[i - 1];
        }

        for (int j = n - 1; j >= 0; j--) {
            B[C[A[j]] - 1] = A[j];
            C[A[j]]--;
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(B[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int pivotIndex = partition(A, 0, n - 1);

        for (int i = 0; i < n; i++) {
            if (i == pivotIndex) {
                System.out.print("[" + A[i] + "]");
            } else {
                System.out.print(A[i]);
            }
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }

    static int partition(int[] A, int p, int r) {
        int x = A[r];
        int i = p - 1;

        for (int j = p; j <= r - 1; j++) {
            if (A[j] <= x) {
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }

        int temp = A[i + 1];
        A[i + 1] = A[r];
        A[r] = temp;

        return i + 1;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int pivotIndex = partition(A, 0, n - 1);

        for (int i = 0; i < n; i++) {
            if (i == pivotIndex) {
                System.out.print("[" + A[i] + "]");
            } else {
                System.out.print(A[i]);
            }
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }

    static int partition(int[] A, int p, int r) {
        int x = A[r];
        int i = p - 1;

        for (int j = p; j <= r - 1; j++) {
            if (A[j] <= x) {
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }

        int temp = A[i + 1];
        A[i + 1] = A[r];
        A[r] = temp;

        return i + 1;
    }
}

import java.util.*;

public class Main {
    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int val) {
            this.val = val;
        }
    }

    static Map<Integer, Integer> inorderMap;
    static int preorderIndex;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] preorder = new int[n];
        int[] inorder = new int[n];

        for (int i = 0; i < n; i++) {
            preorder[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            inorder[i] = sc.nextInt();
        }

        inorderMap = new HashMap<>();
        for (int i = 0; i < n; i++) {
            inorderMap.put(inorder[i], i);
        }

        preorderIndex = 0;
        TreeNode root = buildTree(preorder, 0, n - 1);

        List<Integer> postorder = new ArrayList<>();
        postorderTraversal(root, postorder);

        for (int i = 0; i < postorder.size(); i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(postorder.get(i));
        }
        System.out.println();
    }

    static TreeNode buildTree(int[] preorder, int inStart, int inEnd) {
        if (inStart > inEnd) return null;

        int rootVal = preorder[preorderIndex++];
        TreeNode root = new TreeNode(rootVal);

        int inIndex = inorderMap.get(rootVal);

        root.left = buildTree(preorder, inStart, inIndex - 1);
        root.right = buildTree(preorder, inIndex + 1, inEnd);

        return root;
    }

    static void postorderTraversal(TreeNode node, List<Integer> result) {
        if (node == null) return;

        postorderTraversal(node.left, result);
        postorderTraversal(node.right, result);
        result.add(node.val);
    }
}

import java.util.*;

public class Main {
    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int val) {
            this.val = val;
        }
    }

    static Map<Integer, Integer> inorderMap;
    static int preorderIndex;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] preorder = new int[n];
        int[] inorder = new int[n];

        for (int i = 0; i < n; i++) {
            preorder[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            inorder[i] = sc.nextInt();
        }

        inorderMap = new HashMap<>();
        for (int i = 0; i < n; i++) {
            inorderMap.put(inorder[i], i);
        }

        preorderIndex = 0;
        TreeNode root = buildTree(preorder, 0, n - 1);

        List<Integer> postorder = new ArrayList<>();
        postorderTraversal(root, postorder);

        for (int i = 0; i < postorder.size(); i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(postorder.get(i));
        }
        System.out.println();
    }

    static TreeNode buildTree(int[] preorder, int inStart, int inEnd) {
        if (inStart > inEnd) return null;

        int rootVal = preorder[preorderIndex++];
        TreeNode root = new TreeNode(rootVal);

        int inIndex = inorderMap.get(rootVal);

        root.left = buildTree(preorder, inStart, inIndex - 1);
        root.right = buildTree(preorder, inIndex + 1, inEnd);

        return root;
    }

    static void postorderTraversal(TreeNode node, List<Integer> result) {
        if (node == null) return;

        postorderTraversal(node.left, result);
        postorderTraversal(node.right, result);
        result.add(node.val);
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key, priority;
        Node left, right;

        Node(int key, int priority) {
            this.key = key;
            this.priority = priority;
            this.left = null;
            this.right = null;
        }
    }

    static class Treap {
        Node root;

        Treap() {
            root = null;
        }

        Node rightRotate(Node t) {
            Node s = t.left;
            t.left = s.right;
            s.right = t;
            return s;
        }

        Node leftRotate(Node t) {
            Node s = t.right;
            t.right = s.left;
            s.left = t;
            return s;
        }

        Node insert(Node t, int key, int priority) {
            if (t == null) {
                return new Node(key, priority);
            }
            if (key == t.key) {
                return t;
            }

            if (key < t.key) {
                t.left = insert(t.left, key, priority);
                if (t.priority < t.left.priority) {
                    t = rightRotate(t);
                }
            } else {
                t.right = insert(t.right, key, priority);
                if (t.priority < t.right.priority) {
                    t = leftRotate(t);
                }
            }
            return t;
        }

        Node delete(Node t, int key) {
            if (t == null) {
                return null;
            }
            if (key < t.key) {
                t.left = delete(t.left, key);
            } else if (key > t.key) {
                t.right = delete(t.right, key);
            } else {
                return _delete(t, key);
            }
            return t;
        }

        Node _delete(Node t, int key) {
            if (t.left == null && t.right == null) {
                return null;
            } else if (t.left == null) {
                t = leftRotate(t);
            } else if (t.right == null) {
                t = rightRotate(t);
            } else {
                if (t.left.priority > t.right.priority) {
                    t = rightRotate(t);
                } else {
                    t = leftRotate(t);
                }
            }
            return delete(t, key);
        }

        boolean find(Node t, int key) {
            if (t == null) {
                return false;
            }
            if (key == t.key) {
                return true;
            } else if (key < t.key) {
                return find(t.left, key);
            } else {
                return find(t.right, key);
            }
        }

        void inorder(Node t, List<Integer> result) {
            if (t != null) {
                inorder(t.left, result);
                result.add(t.key);
                inorder(t.right, result);
            }
        }

        void preorder(Node t, List<Integer> result) {
            if (t != null) {
                result.add(t.key);
                preorder(t.left, result);
                preorder(t.right, result);
            }
        }

        void insert(int key, int priority) {
            root = insert(root, key, priority);
        }

        void delete(int key) {
            root = delete(root, key);
        }

        boolean find(int key) {
            return find(root, key);
        }

        void print() {
            List<Integer> inorderResult = new ArrayList<>();
            List<Integer> preorderResult = new ArrayList<>();

            inorder(root, inorderResult);
            preorder(root, preorderResult);

            for (int key : inorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();

            for (int key : preorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        Treap treap = new Treap();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int k = sc.nextInt();
                int p = sc.nextInt();
                treap.insert(k, p);
            } else if (operation.equals("find")) {
                int k = sc.nextInt();
                if (treap.find(k)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("delete")) {
                int k = sc.nextInt();
                treap.delete(k);
            } else if (operation.equals("print")) {
                treap.print();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key, priority;
        Node left, right;

        Node(int key, int priority) {
            this.key = key;
            this.priority = priority;
            this.left = null;
            this.right = null;
        }
    }

    static class Treap {
        Node root;

        Treap() {
            root = null;
        }

        Node rightRotate(Node t) {
            Node s = t.left;
            t.left = s.right;
            s.right = t;
            return s;
        }

        Node leftRotate(Node t) {
            Node s = t.right;
            t.right = s.left;
            s.left = t;
            return s;
        }

        Node insert(Node t, int key, int priority) {
            if (t == null) {
                return new Node(key, priority);
            }
            if (key == t.key) {
                return t;
            }

            if (key < t.key) {
                t.left = insert(t.left, key, priority);
                if (t.priority < t.left.priority) {
                    t = rightRotate(t);
                }
            } else {
                t.right = insert(t.right, key, priority);
                if (t.priority < t.right.priority) {
                    t = leftRotate(t);
                }
            }
            return t;
        }

        Node delete(Node t, int key) {
            if (t == null) {
                return null;
            }
            if (key < t.key) {
                t.left = delete(t.left, key);
            } else if (key > t.key) {
                t.right = delete(t.right, key);
            } else {
                return _delete(t, key);
            }
            return t;
        }

        Node _delete(Node t, int key) {
            if (t.left == null && t.right == null) {
                return null;
            } else if (t.left == null) {
                t = leftRotate(t);
            } else if (t.right == null) {
                t = rightRotate(t);
            } else {
                if (t.left.priority > t.right.priority) {
                    t = rightRotate(t);
                } else {
                    t = leftRotate(t);
                }
            }
            return delete(t, key);
        }

        boolean find(Node t, int key) {
            if (t == null) {
                return false;
            }
            if (key == t.key) {
                return true;
            } else if (key < t.key) {
                return find(t.left, key);
            } else {
                return find(t.right, key);
            }
        }

        void inorder(Node t, List<Integer> result) {
            if (t != null) {
                inorder(t.left, result);
                result.add(t.key);
                inorder(t.right, result);
            }
        }

        void preorder(Node t, List<Integer> result) {
            if (t != null) {
                result.add(t.key);
                preorder(t.left, result);
                preorder(t.right, result);
            }
        }

        void insert(int key, int priority) {
            root = insert(root, key, priority);
        }

        void delete(int key) {
            root = delete(root, key);
        }

        boolean find(int key) {
            return find(root, key);
        }

        void print() {
            List<Integer> inorderResult = new ArrayList<>();
            List<Integer> preorderResult = new ArrayList<>();

            inorder(root, inorderResult);
            preorder(root, preorderResult);

            for (int key : inorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();

            for (int key : preorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        Treap treap = new Treap();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int k = sc.nextInt();
                int p = sc.nextInt();
                treap.insert(k, p);
            } else if (operation.equals("find")) {
                int k = sc.nextInt();
                if (treap.find(k)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("delete")) {
                int k = sc.nextInt();
                treap.delete(k);
            } else if (operation.equals("print")) {
                treap.print();
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i] + ", ");

            if (i > 1) {
                int parent = i / 2;
                System.out.print("parent key = " + heap[parent] + ", ");
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print("left key = " + heap[left] + ", ");
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print("right key = " + heap[right] + ", ");
            }

            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i] + ", ");

            if (i > 1) {
                int parent = i / 2;
                System.out.print("parent key = " + heap[parent] + ", ");
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print("left key = " + heap[left] + ", ");
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print("right key = " + heap[right] + ", ");
            }

            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static int[] A;
    private static int H;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        A = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            A[i] = sc.nextInt();
        }

        buildMaxHeap();

        for (int i = 1; i <= H; i++) {
            System.out.print(" " + A[i]);
        }
        System.out.println();
    }

    private static void buildMaxHeap() {
        for (int i = H / 2; i >= 1; i--) {
            maxHeapify(i);
        }
    }

    private static void maxHeapify(int i) {
        int l = 2 * i;
        int r = 2 * i + 1;
        int largest;

        if (l <= H && A[l] > A[i]) {
            largest = l;
        } else {
            largest = i;
        }

        if (r <= H && A[r] > A[largest]) {
            largest = r;
        }

        if (largest != i) {
            int temp = A[i];
            A[i] = A[largest];
            A[largest] = temp;
            maxHeapify(largest);
        }
    }
}

import java.util.Scanner;

public class Main {
    private static int[] A;
    private static int H;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        A = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            A[i] = sc.nextInt();
        }

        buildMaxHeap();

        for (int i = 1; i <= H; i++) {
            System.out.print(" " + A[i]);
        }
        System.out.println();
    }

    private static void buildMaxHeap() {
        for (int i = H / 2; i >= 1; i--) {
            maxHeapify(i);
        }
    }

    private static void maxHeapify(int i) {
        int l = 2 * i;
        int r = 2 * i + 1;
        int largest;

        if (l <= H && A[l] > A[i]) {
            largest = l;
        } else {
            largest = i;
        }

        if (r <= H && A[r] > A[largest]) {
            largest = r;
        }

        if (largest != i) {
            int temp = A[i];
            A[i] = A[largest];
            A[largest] = temp;

            maxHeapify(largest);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            System.out.println(ccw(x0, y0, x1, y1, x2, y2));
        }

        sc.close();
    }

    static String ccw(int x0, int y0, int x1, int y1, int x2, int y2) {
        long cross = (long)(x1 - x0) * (y2 - y0) - (long)(y1 - y0) * (x2 - x0);

        if (cross > 0) {
            return "COUNTER_CLOCKWISE";
        } else if (cross < 0) {
            return "CLOCKWISE";
        } else {
            long dot = (long)(x2 - x0) * (x1 - x0) + (long)(y2 - y0) * (y1 - y0);
            long len2 = (long)(x1 - x0) * (x1 - x0) + (long)(y1 - y0) * (y1 - y0);

            if (dot < 0) {
                return "ONLINE_BACK";
            } else if (dot > len2) {
                return "ONLINE_FRONT";
            } else {
                return "ON_SEGMENT";
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            System.out.println(ccw(x0, y0, x1, y1, x2, y2));
        }

        sc.close();
    }

    static String ccw(int x0, int y0, int x1, int y1, int x2, int y2) {
        long cross = (long)(x1 - x0) * (y2 - y0) - (long)(y1 - y0) * (x2 - x0);

        if (cross > 0) {
            return "COUNTER_CLOCKWISE";
        } else if (cross < 0) {
            return "CLOCKWISE";
        } else {
            long dot = (long)(x2 - x0) * (x1 - x0) + (long)(y2 - y0) * (y1 - y0);
            long len2 = (long)(x1 - x0) * (x1 - x0) + (long)(y1 - y0) * (y1 - y0);

            if (dot < 0) {
                return "ONLINE_BACK";
            } else if (dot > len2) {
                return "ONLINE_FRONT";
            } else {
                return "ON_SEGMENT";
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        System.out.println(dp[W]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        System.out.println(dp[W]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    private static class SegmentTree {
        private int[] tree;
        private int n;

        public SegmentTree(int size) {
            n = size;
            tree = new int[4 * n];
            build(1, 0, n - 1);
        }

        private void build(int node, int start, int end) {
            if (start == end) {
                tree[node] = Integer.MAX_VALUE;
            } else {
                int mid = (start + end) / 2;
                build(2 * node, start, mid);
                build(2 * node + 1, mid + 1, end);
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public void update(int node, int start, int end, int idx, int val) {
            if (start == end) {
                tree[node] = val;
            } else {
                int mid = (start + end) / 2;
                if (idx <= mid) {
                    update(2 * node, start, mid, idx, val);
                } else {
                    update(2 * node + 1, mid + 1, end, idx, val);
                }
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public int query(int node, int start, int end, int l, int r) {
            if (r < start || end < l) {
                return Integer.MAX_VALUE;
            }
            if (l <= start && end <= r) {
                return tree[node];
            }
            int mid = (start + end) / 2;
            int p1 = query(2 * node, start, mid, l, r);
            int p2 = query(2 * node + 1, mid + 1, end, l, r);
            return Math.min(p1, p2);
        }

        public void update(int idx, int val) {
            update(1, 0, n - 1, idx, val);
        }

        public int query(int l, int r) {
            return query(1, 0, n - 1, l, r);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        SegmentTree st = new SegmentTree(n);

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                st.update(x, y);
            } else {
                System.out.println(st.query(x, y));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static class SegmentTree {
        private int[] tree;
        private int n;

        public SegmentTree(int size) {
            n = size;
            tree = new int[4 * n];
            build(1, 0, n - 1);
        }

        private void build(int node, int start, int end) {
            if (start == end) {
                tree[node] = Integer.MAX_VALUE;
            } else {
                int mid = (start + end) / 2;
                build(2 * node, start, mid);
                build(2 * node + 1, mid + 1, end);
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public void update(int node, int start, int end, int idx, int val) {
            if (start == end) {
                tree[node] = val;
            } else {
                int mid = (start + end) / 2;
                if (idx <= mid) {
                    update(2 * node, start, mid, idx, val);
                } else {
                    update(2 * node + 1, mid + 1, end, idx, val);
                }
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public int query(int node, int start, int end, int l, int r) {
            if (r < start || end < l) {
                return Integer.MAX_VALUE;
            }
            if (l <= start && end <= r) {
                return tree[node];
            }
            int mid = (start + end) / 2;
            int p1 = query(2 * node, start, mid, l, r);
            int p2 = query(2 * node + 1, mid + 1, end, l, r);
            return Math.min(p1, p2);
        }

        public void update(int idx, int val) {
            update(1, 0, n - 1, idx, val);
        }

        public int query(int l, int r) {
            return query(1, 0, n - 1, l, r);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        SegmentTree st = new SegmentTree(n);

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                st.update(x, y);
            } else {
                System.out.println(st.query(x, y));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                arr[x] += y;
            } else {
                long sum = 0;
                for (int j = x; j <= y; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                arr[x] += y;
            } else {
                long sum = 0;
                for (int j = x; j <= y; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();
                for (int j = s; j <= t; j++) {
                    arr[j] += x;
                }
            } else {
                int s = sc.nextInt();
                int t = sc.nextInt();
                long sum = 0;
                for (int j = s; j <= t; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();
                for (int j = s; j <= t; j++) {
                    arr[j] += x;
                }
            } else {
                int s = sc.nextInt();
                int t = sc.nextInt();
                long sum = 0;
                for (int j = s; j <= t; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, cost;
        Edge(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            graph.get(s).add(new Edge(t, d));
        }

        int[] dist = new int[V];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[r] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(r, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int cost = edge.cost;

                if (dist[u] + cost < dist[v]) {
                    dist[v] = dist[u] + cost;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < V; i++) {
            if (dist[i] == Integer.MAX_VALUE) {
                System.out.println("INF");
            } else {
                System.out.println(dist[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, cost;
        Edge(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            graph.get(s).add(new Edge(t, d));
        }

        int[] dist = new int[V];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[r] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(r, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int cost = edge.cost;

                if (dist[u] + cost < dist[v]) {
                    dist[v] = dist[u] + cost;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < V; i++) {
            if (dist[i] == Integer.MAX_VALUE) {
                System.out.println("INF");
            } else {
                System.out.println(dist[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        final long INF = Long.MAX_VALUE / 2;
        long[][] dist = new long[V][V];

        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (i == j) {
                    dist[i][j] = 0;
                } else {
                    dist[i][j] = INF;
                }
            }
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            long d = sc.nextLong();
            dist[s][t] = d;
        }

        for (int k = 0; k < V; k++) {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (dist[i][k] != INF && dist[k][j] != INF) {
                        dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                    }
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (int i = 0; i < V; i++) {
            if (dist[i][i] < 0) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (j > 0) System.out.print(" ");
                    if (dist[i][j] == INF) {
                        System.out.print("INF");
                    } else {
                        System.out.print(dist[i][j]);
                    }
                }
                System.out.println();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        final long INF = Long.MAX_VALUE / 2;
        long[][] dist = new long[V][V];

        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (i == j) {
                    dist[i][j] = 0;
                } else {
                    dist[i][j] = INF;
                }
            }
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            long d = sc.nextLong();
            dist[s][t] = d;
        }

        for (int k = 0; k < V; k++) {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (dist[i][k] != INF && dist[k][j] != INF) {
                        dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                    }
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (int i = 0; i < V; i++) {
            if (dist[i][i] < 0) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (j > 0) System.out.print(" ");
                    if (dist[i][j] == INF) {
                        System.out.print("INF");
                    } else {
                        System.out.print(dist[i][j]);
                    }
                }
                System.out.println();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Edge implements Comparable<Edge> {
        int u, v, weight;

        Edge(int u, int v, int weight) {
            this.u = u;
            this.v = v;
            this.weight = weight;
        }

        @Override
        public int compareTo(Edge other) {
            return Integer.compare(this.weight, other.weight);
        }
    }

    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        boolean union(int x, int y) {
            int px = find(x);
            int py = find(y);

            if (px == py) return false;

            if (rank[px] < rank[py]) {
                parent[px] = py;
            } else if (rank[px] > rank[py]) {
                parent[py] = px;
            } else {
                parent[py] = px;
                rank[px]++;
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<Edge> edges = new ArrayList<>();

        for (int i = 0; i < E; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int w = sc.nextInt();
            edges.add(new Edge(u, v, w));
        }

        Collections.sort(edges);

        UnionFind uf = new UnionFind(V);
        int mstWeight = 0;
        int edgesUsed = 0;

        for (Edge edge : edges) {
            if (uf.union(edge.u, edge.v)) {
                mstWeight += edge.weight;
                edgesUsed++;
                if (edgesUsed == V - 1) break;
            }
        }

        System.out.println(mstWeight);
    }
}

import java.util.*;

public class Main {
    static class Edge implements Comparable<Edge> {
        int u, v, weight;

        Edge(int u, int v, int weight) {
            this.u = u;
            this.v = v;
            this.weight = weight;
        }

        @Override
        public int compareTo(Edge other) {
            return Integer.compare(this.weight, other.weight);
        }
    }

    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        boolean union(int x, int y) {
            int px = find(x);
            int py = find(y);

            if (px == py) return false;

            if (rank[px] < rank[py]) {
                parent[px] = py;
            } else if (rank[px] > rank[py]) {
                parent[py] = px;
            } else {
                parent[py] = px;
                rank[px]++;
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<Edge> edges = new ArrayList<>();

        for (int i = 0; i < E; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int w = sc.nextInt();
            edges.add(new Edge(u, v, w));
        }

        Collections.sort(edges);

        UnionFind uf = new UnionFind(V);
        int mstWeight = 0;
        int edgesUsed = 0;

        for (Edge edge : edges) {
            if (uf.union(edge.u, edge.v)) {
                mstWeight += edge.weight;
                edgesUsed++;
                if (edgesUsed == V - 1) break;
            }
        }

        System.out.println(mstWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
        }

        int[] color = new int[V];

        for (int i = 0; i < V; i++) {
            if (color[i] == 0) {
                if (dfs(graph, i, color)) {
                    System.out.println(1);
                    return;
                }
            }
        }

        System.out.println(0);
    }

    private static boolean dfs(List<List<Integer>> graph, int node, int[] color) {
        color[node] = 1;

        for (int neighbor : graph.get(node)) {
            if (color[neighbor] == 1) {
                return true;
            }
            if (color[neighbor] == 0 && dfs(graph, neighbor, color)) {
                return true;
            }
        }

        color[node] = 2;
        return false;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
        }

        int[] color = new int[V];

        for (int i = 0; i < V; i++) {
            if (color[i] == 0) {
                if (dfs(graph, i, color)) {
                    System.out.println(1);
                    return;
                }
            }
        }

        System.out.println(0);
    }

    private static boolean dfs(List<List<Integer>> graph, int node, int[] color) {
        color[node] = 1;

        for (int neighbor : graph.get(node)) {
            if (color[neighbor] == 1) {
                return true;
            }
            if (color[neighbor] == 0 && dfs(graph, neighbor, color)) {
                return true;
            }
        }

        color[node] = 2;
        return false;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static List<Integer>[] graph;
    static int[] match;
    static boolean[] used;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int E = sc.nextInt();

        graph = new List[X];
        for (int i = 0; i < X; i++) {
            graph[i] = new ArrayList<>();
        }

        for (int i = 0; i < E; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            graph[x].add(y);
        }

        match = new int[Y];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < X; i++) {
            used = new boolean[Y];
            if (dfs(i)) {
                result++;
            }
        }

        System.out.println(result);
    }

    static boolean dfs(int v) {
        for (int to : graph[v]) {
            if (used[to]) continue;
            used[to] = true;

            if (match[to] == -1 || dfs(match[to])) {
                match[to] = v;
                return true;
            }
        }
        return false;
    }
}

import java.util.*;

public class Main {
    static List<Integer>[] graph;
    static int[] match;
    static boolean[] used;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int E = sc.nextInt();

        graph = new List[X];
        for (int i = 0; i < X; i++) {
            graph[i] = new ArrayList<>();
        }

        for (int i = 0; i < E; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            graph[x].add(y);
        }

        match = new int[Y];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < X; i++) {
            used = new boolean[Y];
            if (dfs(i)) {
                result++;
            }
        }

        System.out.println(result);
    }

    static boolean dfs(int v) {
        for (int to : graph[v]) {
            if (used[to]) continue;
            used[to] = true;

            if (match[to] == -1 || dfs(match[to])) {
                match[to] = v;
                return true;
            }
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double C_rad = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(C_rad);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(C_rad));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f\n", S);
        System.out.printf("%.8f\n", L);
        System.out.printf("%.8f\n", h);
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double C_rad = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(C_rad);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(C_rad));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f\n", S);
        System.out.printf("%.8f\n", L);
        System.out.printf("%.8f\n", h);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
                sum += scores[i];
            }

            double mean = (double) sum / n;

            double variance = 0;
            for (int i = 0; i < n; i++) {
                variance += (scores[i] - mean) * (scores[i] - mean);
            }
            variance /= n;

            double standardDeviation = Math.sqrt(variance);

            System.out.printf("%.8f%n", standardDeviation);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
                sum += scores[i];
            }

            double mean = (double) sum / n;
            double variance = 0;

            for (int i = 0; i < n; i++) {
                variance += (scores[i] - mean) * (scores[i] - mean);
            }

            variance /= n;
            double standardDeviation = Math.sqrt(variance);

            System.out.printf("%.8f%n", standardDeviation);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice = new int[6];
        for (int i = 0; i < 6; i++) {
            dice[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        int[][] orientations = {
            {0, 1, 2, 3, 4, 5},
            {0, 2, 4, 1, 3, 5},
            {0, 3, 1, 4, 2, 5},
            {0, 4, 3, 2, 1, 5},
            {1, 0, 3, 2, 5, 4},
            {1, 2, 0, 5, 3, 4},
            {1, 3, 5, 0, 2, 4},
            {1, 5, 2, 3, 0, 4},
            {2, 0, 4, 1, 5, 3},
            {2, 1, 0, 5, 4, 3},
            {2, 4, 5, 0, 1, 3},
            {2, 5, 1, 4, 0, 3},
            {3, 0, 1, 4, 5, 2},
            {3, 1, 5, 0, 4, 2},
            {3, 4, 0, 5, 1, 2},
            {3, 5, 4, 1, 0, 2},
            {4, 0, 2, 3, 5, 1},
            {4, 2, 5, 0, 3, 1},
            {4, 3, 0, 5, 2, 1},
            {4, 5, 3, 2, 0, 1},
            {5, 1, 3, 2, 4, 0},
            {5, 2, 1, 4, 3, 0},
            {5, 3, 4, 1, 2, 0},
            {5, 4, 2, 3, 1, 0}
        };

        for (int i = 0; i < q; i++) {
            int top = sc.nextInt();
            int front = sc.nextInt();

            for (int[] orientation : orientations) {
                if (dice[orientation[0]] == top && dice[orientation[1]] == front) {
                    System.out.println(dice[orientation[2]]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice = new int[6];
        for (int i = 0; i < 6; i++) {
            dice[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        int[][] orientations = {
            {0, 1, 2, 3, 4, 5},
            {0, 2, 4, 1, 3, 5},
            {0, 3, 1, 4, 2, 5},
            {0, 4, 3, 2, 1, 5},
            {1, 0, 3, 2, 5, 4},
            {1, 2, 0, 5, 3, 4},
            {1, 3, 5, 0, 2, 4},
            {1, 5, 2, 3, 0, 4},
            {2, 0, 4, 1, 5, 3},
            {2, 1, 0, 5, 4, 3},
            {2, 4, 5, 0, 1, 3},
            {2, 5, 1, 4, 0, 3},
            {3, 0, 1, 4, 5, 2},
            {3, 1, 5, 0, 4, 2},
            {3, 4, 0, 5, 1, 2},
            {3, 5, 4, 1, 0, 2},
            {4, 0, 2, 3, 5, 1},
            {4, 2, 5, 0, 3, 1},
            {4, 3, 0, 5, 2, 1},
            {4, 5, 3, 2, 0, 1},
            {5, 1, 3, 2, 4, 0},
            {5, 2, 1, 4, 3, 0},
            {5, 3, 4, 1, 2, 0},
            {5, 4, 2, 3, 1, 0}
        };

        for (int i = 0; i < q; i++) {
            int top = sc.nextInt();
            int front = sc.nextInt();

            for (int[] orientation : orientations) {
                if (dice[orientation[0]] == top && dice[orientation[1]] == front) {
                    System.out.println(dice[orientation[2]]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int cube = x * x * x;
        System.out.println(cube);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int cube = x * x * x;
        System.out.println(cube);
        scanner.close();
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
        scanner.close();
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
        scanner.close();
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int S = scanner.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int S = scanner.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (a < b && b < c) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (a < b && b < c) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int mid = a + b + c - min - max;

        System.out.println(min + " " + mid + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int mid = a + b + c - min - max;

        System.out.println(min + " " + mid + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) break;
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) break;
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();
    int count = 0;
    for (int i = a; i <= b; i++) {
      if (c % i == 0) {
        count++;
      }
    }
    System.out.println(count);
  }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();
    int count = 0;
    for (int i = a; i <= b; i++) {
      if (c % i == 0) {
        count++;
      }
    }
    System.out.println(count);
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int a = scanner.nextInt();
            char op = scanner.next().charAt(0);
            int b = scanner.nextInt();

            if (op == '?') {
                break;
            }

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }

            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int a = scanner.nextInt();
            char op = scanner.next().charAt(0);
            int b = scanner.nextInt();

            if (op == '?') {
                break;
            }

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }

            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') break;

            int result = 0;
            switch (op) {
                case '+': result = a + b; break;
                case '-': result = a - b; break;
                case '*': result = a * b; break;
                case '/': result = a / b; break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') break;

            int result = 0;
            switch (op) {
                case '+': result = a + b; break;
                case '-': result = a - b; break;
                case '*': result = a * b; break;
                case '/': result = a / b; break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            int x = i;
            if (x % 3 == 0) {
                System.out.print(" " + i);
                continue;
            }

            while (x > 0) {
                if (x % 10 == 3) {
                    System.out.print(" " + i);
                    break;
                }
                x /= 10;
            }
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            int x = i;

            if (x % 3 == 0) {
                System.out.print(" " + i);
                continue;
            }

            while (x > 0) {
                if (x % 10 == 3) {
                    System.out.print(" " + i);
                    break;
                }
                x /= 10;
            }
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            if (i % 3 == 0 || containsDigit3(i)) {
                System.out.print(" " + i);
            }
        }
        System.out.println();
    }

    static boolean containsDigit3(int x) {
        while (x > 0) {
            if (x % 10 == 3) {
                return true;
            }
            x /= 10;
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            if (i % 3 == 0 || containsDigit3(i)) {
                System.out.print(" " + i);
            }
        }
        System.out.println();
    }

    static boolean containsDigit3(int x) {
        while (x > 0) {
            if (x % 10 == 3) {
                return true;
            }
            x /= 10;
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade = calculateGrade(m, f, r);
            System.out.println(grade);
        }

        sc.close();
    }

    private static char calculateGrade(int m, int f, int r) {
        if (m == -1 || f == -1) {
            return 'F';
        }

        int total = m + f;

        if (total >= 80) {
            return 'A';
        } else if (total >= 65) {
            return 'B';
        } else if (total >= 50) {
            return 'C';
        } else if (total >= 30) {
            if (r >= 50) {
                return 'C';
            } else {
                return 'D';
            }
        } else {
            return 'F';
        }
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    while (true) {
      int m = sc.nextInt();
      int f = sc.nextInt();
      int r = sc.nextInt();

      if (m == -1 && f == -1 && r == -1) {
        break;
      }

      char grade = calculateGrade(m, f, r);
      System.out.println(grade);
    }

    sc.close();
  }

  private static char calculateGrade(int m, int f, int r) {
    if (m == -1 || f == -1) {
      return 'F';
    }

    int total = m + f;

    if (total >= 80) {
      return 'A';
    } else if (total >= 65) {
      return 'B';
    } else if (total >= 50) {
      return 'C';
    } else if (total >= 30) {
      if (r >= 50) {
        return 'C';
      } else {
        return 'D';
      }
    } else {
      return 'F';
    }
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            if (m == -1 || f == -1) {
                System.out.println("F");
                continue;
            }

            int total = m + f;

            if (total >= 80) {
                System.out.println("A");
            } else if (total >= 65) {
                System.out.println("B");
            } else if (total >= 50) {
                System.out.println("C");
            } else if (total >= 30) {
                if (r >= 50) {
                    System.out.println("C");
                } else {
                    System.out.println("D");
                }
            } else {
                System.out.println("F");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            if (m == -1 || f == -1) {
                System.out.println("F");
                continue;
            }

            int total = m + f;

            if (total >= 80) {
                System.out.println("A");
            } else if (total >= 65) {
                System.out.println("B");
            } else if (total >= 50) {
                System.out.println("C");
            } else if (total >= 30) {
                if (r >= 50) {
                    System.out.println("C");
                } else {
                    System.out.println("D");
                }
            } else {
                System.out.println("F");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) break;

            int count = 0;

            for (int i = 1; i <= n - 2; i++) {
                for (int j = i + 1; j <= n - 1; j++) {
                    int k = x - i - j;
                    if (k > j && k <= n) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) break;

            int count = 0;

            for (int i = 1; i <= n - 2; i++) {
                for (int j = i + 1; j <= n - 1; j++) {
                    int k = x - i - j;
                    if (k > j && k <= n) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();
            if (n == 0 && x == 0) {
                break;
            }
            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();
            if (n == 0 && x == 0) {
                break;
            }
            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int r = sc.nextInt();
        int c = sc.nextInt();

        int[][] table = new int[r][c];

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                table[i][j] = sc.nextInt();
            }
        }

        int[] rowSums = new int[r];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                rowSums[i] += table[i][j];
            }
        }

        int[] colSums = new int[c];
        for (int j = 0; j < c; j++) {
            for (int i = 0; i < r; i++) {
                colSums[j] += table[i][j];
            }
        }

        int totalSum = 0;
        for (int i = 0; i < r; i++) {
            totalSum += rowSums[i];
        }

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                System.out.print(table[i][j] + " ");
            }
            System.out.println(rowSums[i]);
        }

        for (int j = 0; j < c; j++) {
            System.out.print(colSums[j] + " ");
        }
        System.out.println(totalSum);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int r = sc.nextInt();
        int c = sc.nextInt();

        int[][] table = new int[r][c];

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                table[i][j] = sc.nextInt();
            }
        }

        int[] rowSums = new int[r];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                rowSums[i] += table[i][j];
            }
        }

        int[] colSums = new int[c];
        for (int j = 0; j < c; j++) {
            for (int i = 0; i < r; i++) {
                colSums[j] += table[i][j];
            }
        }

        int totalSum = 0;
        for (int i = 0; i < r; i++) {
            totalSum += rowSums[i];
        }

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                System.out.print(table[i][j] + " ");
            }
            System.out.println(rowSums[i]);
        }

        for (int j = 0; j < c; j++) {
            System.out.print(colSums[j] + " ");
        }
        System.out.println(totalSum);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        int[][] B = new int[m][l];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                int sum = 0;
                for (int k = 0; k < m; k++) {
                    sum += A[i][k] * B[k][j];
                }
                if (j > 0) System.out.print(" ");
                System.out.print(sum);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        int[][] B = new int[m][l];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                int sum = 0;
                for (int k = 0; k < m; k++) {
                    sum += A[i][k] * B[k][j];
                }
                if (j > 0) System.out.print(" ");
                System.out.print(sum);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[][] B = new int[m][l];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        int[][] C = new int[n][l];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                for (int k = 0; k < m; k++) {
                    C[i][j] += A[i][k] * B[k][j];
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(C[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[][] B = new int[m][l];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        int[][] C = new int[n][l];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                for (int k = 0; k < m; k++) {
                    C[i][j] += A[i][k] * B[k][j];
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(C[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();
        StringBuilder result = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (int i = 0; i < input.length(); i++) {
            char c = input.charAt(i);
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (int i = 0; i < input.length(); i++) {
            char c = input.charAt(i);

            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String deck = sc.nextLine();
            if (deck.equals("-")) {
                break;
            }

            int m = sc.nextInt();

            for (int i = 0; i < m; i++) {
                int h = sc.nextInt();
                String bottom = deck.substring(0, h);
                String remaining = deck.substring(h);
                deck = remaining + bottom;
            }

            System.out.println(deck);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String deck = sc.nextLine();
            if (deck.equals("-")) {
                break;
            }

            int m = sc.nextInt();

            for (int i = 0; i < m; i++) {
                int h = sc.nextInt();
                String bottom = deck.substring(0, h);
                String remaining = deck.substring(h);
                deck = remaining + bottom;
            }

            System.out.println(deck);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int taroScore = 0;
    int hanakoScore = 0;

    for (int i = 0; i < n; i++) {
      String taroCard = sc.next();
      String hanakoCard = sc.next();

      int comparison = taroCard.compareTo(hanakoCard);

      if (comparison > 0) {
        taroScore += 3;
      } else if (comparison < 0) {
        hanakoScore += 3;
      } else {
        taroScore += 1;
        hanakoScore += 1;
      }
    }
    System.out.println(taroScore + " " + hanakoScore);
    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();
            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        StringBuilder sbA = new StringBuilder();
        StringBuilder sbB = new StringBuilder();

        for (int i = 0; i < n; i++) {
            sbA.append(String.format("%04d", a[i]));
        }

        for (int i = 0; i < m; i++) {
            sbB.append(String.format("%04d", b[i]));
        }

        String strA = sbA.toString();
        String strB = sbB.toString();

        if (strB.compareTo(strA) > 0) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        StringBuilder sbA = new StringBuilder();
        StringBuilder sbB = new StringBuilder();

        for (int i = 0; i < n; i++) {
            sbA.append(String.format("%04d", a[i]));
        }

        for (int i = 0; i < m; i++) {
            sbB.append(String.format("%04d", b[i]));
        }

        String strA = sbA.toString();
        String strB = sbB.toString();

        if (strB.compareTo(strA) > 0) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        int minLen = Math.min(n, m);

        for (int i = 0; i < minLen; i++) {
            if (a[i] < b[i]) {
                System.out.println(1);
                return;
            } else if (a[i] > b[i]) {
                System.out.println(0);
                return;
            }
        }

        if (n < m) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        int minLen = Math.min(n, m);
        for (int i = 0; i < minLen; i++) {
            if (a[i] < b[i]) {
                System.out.println(1);
                return;
            } else if (a[i] > b[i]) {
                System.out.println(0);
                return;
            }
        }

        if (n < m) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            reverse(a, b, e);
        }

        for (int i = 0; i < n; i++) {
            System.out.print(a[i]);
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }

    private static void reverse(int[] arr, int start, int end) {
        int left = start;
        int right = end - 1;

        while (left < right) {
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
            left++;
            right--;
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            reverse(a, b, e);
        }

        for (int i = 0; i < n; i++) {
            System.out.print(a[i]);
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }

    private static void reverse(int[] arr, int start, int end) {
        int left = start;
        int right = end - 1;

        while (left < right) {
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
            left++;
            right--;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                String key = sc.next();
                int value = sc.nextInt();
                map.put(key, value);
            } else if (op == 1) {
                String key = sc.next();
                System.out.println(map.get(key));
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                String key = sc.next();
                int value = sc.nextInt();
                map.put(key, value);
            } else if (op == 1) {
                String key = sc.next();
                System.out.println(map.get(key));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(power(m, n, MOD));
    }

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(power(m, n, MOD));
    }

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }

        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < K; i++) {
            result.append("ACL");
        }

        System.out.println(result.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < K; i++) {
            result.append("ACL");
        }

        System.out.println(result.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    System.out.println("Yes");
                    return;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println("No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    System.out.println("Yes");
                    return;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println("No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;
        boolean found = false;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    found = true;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;
        boolean found = false;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    found = true;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long count = 0;

        for (int product = 1; product < N; product++) {
            for (int a = 1; a * a <= product; a++) {
                if (product % a == 0) {
                    if (a * a == product) {
                        count++;
                    } else {
                        count += 2;
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long count = 0;

        for (int product = 1; product < N; product++) {
            for (int a = 1; a * a <= product; a++) {
                if (product % a == 0) {
                    if (a * a == product) {
                        count++;
                    } else {
                        count += 2;
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        boolean[] topWhite = new boolean[N + 1];
        boolean[] leftWhite = new boolean[N + 1];

        for (int i = 1; i <= N; i++) {
            topWhite[i] = false;
            leftWhite[i] = false;
        }

        for (int q = 0; q < Q; q++) {
            int type = sc.nextInt();
            int x = sc.nextInt();

            if (type == 1) {
                topWhite[x] = true;
            } else {
                leftWhite[x] = true;
            }
        }

        long blackStones = 0;

        for (int i = 2; i <= N - 1; i++) {
            for (int j = 2; j <= N - 1; j++) {
                if (!topWhite[j] && !leftWhite[i]) {
                    blackStones++;
                }
            }
        }

        System.out.println(blackStones);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        boolean[] topWhite = new boolean[N + 1];
        boolean[] leftWhite = new boolean[N + 1];

        for (int i = 1; i <= N; i++) {
            topWhite[i] = false;
            leftWhite[i] = false;
        }

        for (int q = 0; q < Q; q++) {
            int type = sc.nextInt();
            int x = sc.nextInt();

            if (type == 1) {
                topWhite[x] = true;
            } else {
                leftWhite[x] = true;
            }
        }

        long blackStones = 0;

        for (int i = 2; i <= N - 1; i++) {
            for (int j = 2; j <= N - 1; j++) {
                if (!topWhite[j] && !leftWhite[i]) {
                    blackStones++;
                }
            }
        }

        System.out.println(blackStones);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Long.MIN_VALUE;
        max = Math.max(max, a * c);
        max = Math.max(max, a * d);
        max = Math.max(max, b * c);
        max = Math.max(max, b * d);

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Long.MIN_VALUE;

        max = Math.max(max, a * c);
        max = Math.max(max, a * d);
        max = Math.max(max, b * c);
        max = Math.max(max, b * d);

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];
        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];

        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];
        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] a = new int[n];
        int[] b = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            b[i] = sc.nextInt();
        }

        List<Integer> bList = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            bList.add(b[i]);
        }

        int[] result = new int[n];
        boolean[] used = new boolean[n];

        for (int i = 0; i < n; i++) {
            boolean found = false;

            for (int j = 0; j < n; j++) {
                if (!used[j] && b[j] != a[i]) {
                    result[i] = b[j];
                    used[j] = true;
                    found = true;
                    break;
                }
            }

            if (!found) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
        for (int i = 0; i < n; i++) {
            System.out.print(result[i]);
            if (i < n - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] a = new int[n];
        int[] b = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            b[i] = sc.nextInt();
        }

        List<Integer> bList = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            bList.add(b[i]);
        }

        int[] result = new int[n];
        boolean[] used = new boolean[n];

        for (int i = 0; i < n; i++) {
            boolean found = false;
            for (int j = 0; j < n; j++) {
                if (!used[j] && b[j] != a[i]) {
                    result[i] = b[j];
                    used[j] = true;
                    found = true;
                    break;
                }
            }

            if (!found) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
        for (int i = 0; i < n; i++) {
            System.out.print(result[i]);
            if (i < n - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        UnionFind uf = new UnionFind(N);

        for (int i = 0; i < Q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        UnionFind uf = new UnionFind(N);

        for (int i = 0; i < Q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();
        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();
        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;

        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;
        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;
        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;

        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        int sum = 0;
        for (char c : n.toCharArray()) {
            sum += c - '0';
        }

        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        int sum = 0;
        for (char c : n.toCharArray()) {
            sum += c - '0';
        }

        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int D = sc.nextInt();

        int count = 0;
        for (int i = 0; i < N; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (x * x + y * y <= D * D) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int D = sc.nextInt();

        int count = 0;
        for (int i = 0; i < N; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (x * x + y * y <= D * D) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        Set<Integer> seen = new HashSet<>();
        int remainder = 0;
        int position = 0;

        while (true) {
            remainder = (remainder * 10 + 7) % K;
            position++;

            if (remainder == 0) {
                System.out.println(position);
                return;
            }

            if (seen.contains(remainder)) {
                System.out.println(-1);
                return;
            }

            seen.add(remainder);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        Set<Integer> seen = new HashSet<>();
        int remainder = 0;
        int position = 0;

        while (true) {
            remainder = (remainder * 10 + 7) % K;
            position++;

            if (remainder == 0) {
                System.out.println(position);
                return;
            }

            if (seen.contains(remainder)) {
                System.out.println(-1);
                return;
            }

            seen.add(remainder);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K + 1; i <= N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K + 1; i <= N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();
        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int firstMultiple = ((L + d - 1) / d) * d;

        int lastMultiple = (R / d) * d;

        if (firstMultiple <= R) {
            int count = (lastMultiple - firstMultiple) / d + 1;
            System.out.println(count);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int firstMultiple = ((L + d - 1) / d) * d;

        int lastMultiple = (R / d) * d;

        if (firstMultiple <= R) {
            int count = (lastMultiple - firstMultiple) / d + 1;
            System.out.println(count);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int bills = (N + 999) / 1000;

        int change = bills * 1000 - N;

        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int bills = (N + 999) / 1000;

        int change = bills * 1000 - N;

        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int bills = (N + 999) / 1000;
        int change = bills * 1000 - N;
        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int bills = (N + 999) / 1000;
        int change = bills * 1000 - N;
        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackCount = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowPainted = (rowMask & (1 << i)) != 0;
                            boolean colPainted = (colMask & (1 << j)) != 0;

                            if (!rowPainted && !colPainted) {
                                blackCount++;
                            }
                        }
                    }
                }

                if (blackCount == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackCount = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowPainted = (rowMask & (1 << i)) != 0;
                            boolean colPainted = (colMask & (1 << j)) != 0;

                            if (!rowPainted && !colPainted) {
                                blackCount++;
                            }
                        }
                    }
                }

                if (blackCount == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int result = a + a * a + a * a * a;
        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int result = a + a * a + a * a * a;
        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int operations = 0;
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) != T.charAt(i)) {
                operations++;
            }
        }

        System.out.println(operations);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int operations = 0;
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) != T.charAt(i)) {
                operations++;
            }
        }

        System.out.println(operations);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int operations = 0;
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) != T.charAt(i)) {
                operations++;
            }
        }

        System.out.println(operations);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int operations = 0;
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) != T.charAt(i)) {
                operations++;
            }
        }

        System.out.println(operations);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int operations = 0;
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) != T.charAt(i)) {
                operations++;
            }
        }

        System.out.println(operations);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long result = 0;

        for (int d = 1; d <= N; d++) {
            long count = N / d;
            result += (long) d * count * (count + 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long result = 0;

        for (int d = 1; d <= N; d++) {
            long count = N / d;
            result += (long) d * count * (count + 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long result = 0;

        for (int d = 1; d <= N; d++) {
            long count = N / d;
            result += (long) d * count * (count + 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long result = 0;

        for (int d = 1; d <= N; d++) {
            long count = N / d;
            result += (long) d * count * (count + 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long target = 0;
        for (int i = 2; i < n; i++) {
            target ^= a[i];
        }

        for (long x = 0; x < a[0]; x++) {
            long pile1 = a[0] - x;
            long pile2 = a[1] + x;

            if ((pile1 ^ pile2) == target) {
                System.out.println(x);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long target = 0;
        for (int i = 2; i < n; i++) {
            target ^= a[i];
        }

        for (long x = 0; x < a[0]; x++) {
            long pile1 = a[0] - x;
            long pile2 = a[1] + x;

            if ((pile1 ^ pile2) == target) {
                System.out.println(x);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);

        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);

        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);

        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);

        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);
        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);
        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char alpha = sc.next().charAt(0);
        if (Character.isUpperCase(alpha)) {
            System.out.println("A");
        } else {
            System.out.println("a");
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] prices = new int[N];
        for (int i = 0; i < N; i++) {
            prices[i] = sc.nextInt();
        }

        Arrays.sort(prices);

        int total = 0;
        for (int i = 0; i < K; i++) {
            total += prices[i];
        }

        System.out.println(total);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] prices = new int[N];
        for (int i = 0; i < N; i++) {
            prices[i] = sc.nextInt();
        }

        Arrays.sort(prices);

        int total = 0;
        for (int i = 0; i < K; i++) {
            total += prices[i];
        }

        System.out.println(total);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] prices = new int[N];
        for (int i = 0; i < N; i++) {
            prices[i] = sc.nextInt();
        }

        Arrays.sort(prices);

        int sum = 0;
        for (int i = 0; i < K; i++) {
            sum += prices[i];
        }

        System.out.println(sum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] prices = new int[N];
        for (int i = 0; i < N; i++) {
            prices[i] = sc.nextInt();
        }

        Arrays.sort(prices);

        int sum = 0;
        for (int i = 0; i < K; i++) {
            sum += prices[i];
        }

        System.out.println(sum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Map<Integer, Long> count = new HashMap<>();

        for (int i = 0; i < N; i++) {
            int a = sc.nextInt();
            count.put(a, count.getOrDefault(a, 0L) + 1);
        }

        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            int B = sc.nextInt();
            int C = sc.nextInt();

            if (count.containsKey(B)) {
                long countB = count.get(B);
                count.remove(B);
                count.put(C, count.getOrDefault(C, 0L) + countB);
            }

            long sum = 0;
            for (Map.Entry<Integer, Long> entry : count.entrySet()) {
                sum += (long)entry.getKey() * entry.getValue();
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Map<Integer, Long> count = new HashMap<>();

        for (int i = 0; i < N; i++) {
            int a = sc.nextInt();
            count.put(a, count.getOrDefault(a, 0L) + 1);
        }

        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            int B = sc.nextInt();
            int C = sc.nextInt();

            if (count.containsKey(B)) {
                long countB = count.get(B);
                count.remove(B);
                count.put(C, count.getOrDefault(C, 0L) + countB);
            }

            long sum = 0;
            for (Map.Entry<Integer, Long> entry : count.entrySet()) {
                sum += (long) entry.getKey() * entry.getValue();
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int s = 0;
        for (int i = 0; i < n; i++) {
            s ^= a[i];
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(s ^ a[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int s = 0;
        for (int i = 0; i < n; i++) {
            s ^= a[i];
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(s ^ a[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int result = 360 / gcd(X, 360);
        System.out.println(result);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int result = 360 / gcd(X, 360);
        System.out.println(result);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int result = 360 / gcd(360, X);
        System.out.println(result);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int result = 360 / gcd(360, X);
        System.out.println(result);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 1; i <= 5; i++) {
            int x = sc.nextInt();
            if (x == 0) {
                System.out.println(i);
                break;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();

        for (int cranes = 0; cranes <= X; cranes++) {
            int turtles = X - cranes;
            int totalLegs = cranes * 2 + turtles * 4;

            if (totalLegs == Y) {
                System.out.println("Yes");
                return;
            }
        }

        System.out.println("No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();

        for (int cranes = 0; cranes <= X; cranes++) {
            int turtles = X - cranes;
            int totalLegs = cranes * 2 + turtles * 4;

            if (totalLegs == Y) {
                System.out.println("Yes");
                return;
            }
        }

        System.out.println("No");
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] A = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }

        for (int k = 0; k < K; k++) {
            int[] B = new int[N + 1];

            for (int i = 1; i <= N; i++) {
                int left = Math.max(1, i - A[i]);
                int right = Math.min(N, i + A[i]);
                for (int j = left; j <= right; j++) {
                    B[j]++;
                }
            }

            A = B;
        }

        for (int i = 1; i <= N; i++) {
            System.out.print(A[i]);
            if (i < N) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] A = new int[N + 1];

        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }

        for (int k = 0; k < K; k++) {
            int[] B = new int[N + 1];

            for (int i = 1; i <= N; i++) {
                int left = Math.max(1, i - A[i]);
                int right = Math.min(N, i + A[i]);
                for (int j = left; j <= right; j++) {
                    B[j]++;
                }
            }

            A = B;
        }

        for (int i = 1; i <= N; i++) {
            System.out.print(A[i]);
            if (i < N) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] A = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }

        for (int k = 0; k < K; k++) {
            int[] B = new int[N + 1];

            for (int i = 1; i <= N; i++) {
                int left = Math.max(1, i - A[i]);
                int right = Math.min(N, i + A[i]);
                for (int j = left; j <= right; j++) {
                    B[j]++;
                }
            }

            A = B;
        }

        for (int i = 1; i <= N; i++) {
            System.out.print(A[i]);
            if (i < N) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] V = new int[N + 1];
        int[] W = new int[N + 1];

        for (int i = 1; i <= N; i++) {
            V[i] = sc.nextInt();
            W[i] = sc.nextInt();
        }

        int Q = sc.nextInt();

        for (int q = 0; q < Q; q++) {
            int v = sc.nextInt();
            int L = sc.nextInt();

            List<Integer> path = new ArrayList<>();
            int curr = v;
            while (curr >= 1) {
                path.add(curr);
                curr = curr / 2;
            }

            int[] dp = new int[L + 1];

            for (int node : path) {
                int weight = W[node];
                int value = V[node];

                for (int w = L; w >= weight; w--) {
                    dp[w] = Math.max(dp[w], dp[w - weight] + value);
                }
            }

            System.out.println(dp[L]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] V = new int[N + 1];
        int[] W = new int[N + 1];

        for (int i = 1; i <= N; i++) {
            V[i] = sc.nextInt();
            W[i] = sc.nextInt();
        }

        int Q = sc.nextInt();

        for (int q = 0; q < Q; q++) {
            int v = sc.nextInt();
            int L = sc.nextInt();

            List<Integer> path = new ArrayList<>();
            int curr = v;
            while (curr >= 1) {
                path.add(curr);
                curr = curr / 2;
            }

            int[] dp = new int[L + 1];

            for (int node : path) {
                int weight = W[node];
                int value = V[node];

                for (int w = L; w >= weight; w--) {
                    dp[w] = Math.max(dp[w], dp[w - weight] + value);
                }
            }

            System.out.println(dp[L]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        System.out.println(A * B);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        int result = 0;
        for (int i = 0; i < B; i++) {
            result += A;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int result = 0;
        for (int i = 0; i < B; i++) {
            result += A;
        }
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long result = 1;
        long limit = 1000000000000000000L;

        for (int i = 0; i < n; i++) {
            long a = sc.nextLong();

            if (a == 0) {
                System.out.println(0);
                return;
            }

            if (result > limit / a) {
                System.out.println(-1);
                return;
            }

            result *= a;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long result = 1;
        long limit = 1000000000000000000L;

        for (int i = 0; i < n; i++) {
            long a = sc.nextLong();

            if (a == 0) {
                System.out.println(0);
                return;
            }

            if (result > limit / a) {
                System.out.println(-1);
                return;
            }

            result *= a;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long result = 1;
        long limit = 1000000000000000000L;

        for (int i = 0; i < n; i++) {
            long a = sc.nextLong();

            if (a == 0) {
                System.out.println(0);
                return;
            }

            if (result > limit / a) {
                System.out.println(-1);
                return;
            }

            result *= a;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long result = 1;
        long limit = 1000000000000000000L;

        for (int i = 0; i < n; i++) {
            long a = sc.nextLong();

            if (a == 0) {
                System.out.println(0);
                return;
            }

            if (result > limit / a) {
                System.out.println(-1);
                return;
            }

            result *= a;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        double B = sc.nextDouble();

        long result = (long)(A * B);
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        double B = sc.nextDouble();

        long result = (long)(A * B);
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int onesPlace = N % 10;

        if (onesPlace == 2 || onesPlace == 4 || onesPlace == 5 || onesPlace == 7 || onesPlace == 9) {
            System.out.println("hon");
        } else if (onesPlace == 0 || onesPlace == 1 || onesPlace == 6 || onesPlace == 8) {
            System.out.println("pon");
        } else if (onesPlace == 3) {
            System.out.println("bon");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int onesPlace = N % 10;

        if (onesPlace == 2 || onesPlace == 4 || onesPlace == 5 || onesPlace == 7 || onesPlace == 9) {
            System.out.println("hon");
        } else if (onesPlace == 0 || onesPlace == 1 || onesPlace == 6 || onesPlace == 8) {
            System.out.println("pon");
        } else if (onesPlace == 3) {
            System.out.println("bon");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int onesDigit = N % 10;

        if (onesDigit == 2 || onesDigit == 4 || onesDigit == 5 || onesDigit == 7 || onesDigit == 9) {
            System.out.println("hon");
        } else if (onesDigit == 0 || onesDigit == 1 || onesDigit == 6 || onesDigit == 8) {
            System.out.println("pon");
        } else if (onesDigit == 3) {
            System.out.println("bon");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int onesDigit = N % 10;

        if (onesDigit == 2 || onesDigit == 4 || onesDigit == 5 || onesDigit == 7 || onesDigit == 9) {
            System.out.println("hon");
        } else if (onesDigit == 0 || onesDigit == 1 || onesDigit == 6 || onesDigit == 8) {
            System.out.println("pon");
        } else if (onesDigit == 3) {
            System.out.println("bon");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        String S = sc.next();

        if (S.length() <= K) {
            System.out.println(S);
        } else {
            System.out.println(S.substring(0, K) + "...");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        String S = sc.next();

        if (S.length() <= K) {
            System.out.println(S);
        } else {
            System.out.println(S.substring(0, K) + "...");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        String S = sc.next();

        if (S.length() <= K) {
            System.out.println(S);
        } else {
            System.out.println(S.substring(0, K) + "...");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int H = sc.nextInt();
        int M = sc.nextInt();

        int totalMinutes = H * 60 + M;

        double hourAngle = (totalMinutes * 0.5) % 360;

        double minuteAngle = (totalMinutes * 6) % 360;

        double angleDiff = Math.abs(hourAngle - minuteAngle);
        if (angleDiff > 180) {
            angleDiff = 360 - angleDiff;
        }

        double angleRad = Math.toRadians(angleDiff);

        double distance = Math.sqrt(A * A + B * B - 2 * A * B * Math.cos(angleRad));

        System.out.println(distance);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int H = sc.nextInt();
        int M = sc.nextInt();

        int totalMinutes = H * 60 + M;

        double hourAngle = (totalMinutes * 0.5) % 360;

        double minuteAngle = (totalMinutes * 6) % 360;

        double angleDiff = Math.abs(hourAngle - minuteAngle);
        if (angleDiff > 180) {
            angleDiff = 360 - angleDiff;
        }

        double angleRad = Math.toRadians(angleDiff);

        double distance = Math.sqrt(A * A + B * B - 2 * A * B * Math.cos(angleRad));

        System.out.println(distance);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int H = sc.nextInt();
        int M = sc.nextInt();

        int totalMinutes = H * 60 + M;

        double hourAngle = (totalMinutes * 0.5) % 360;

        double minuteAngle = (totalMinutes * 6) % 360;

        double angleDiff = Math.abs(hourAngle - minuteAngle);
        if (angleDiff > 180) {
            angleDiff = 360 - angleDiff;
        }

        double angleRad = Math.toRadians(angleDiff);

        double distance = Math.sqrt(A * A + B * B - 2 * A * B * Math.cos(angleRad));

        System.out.println(distance);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            graph.get(a).add(b);
            graph.get(b).add(a);
        }

        int[] dist = new int[N + 1];
        Arrays.fill(dist, -1);
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);
        dist[1] = 0;

        while (!queue.isEmpty()) {
            int curr = queue.poll();
            for (int next : graph.get(curr)) {
                if (dist[next] == -1) {
                    dist[next] = dist[curr] + 1;
                    queue.offer(next);
                }
            }
        }

        int[] signpost = new int[N + 1];
        boolean possible = true;

        for (int i = 2; i <= N; i++) {
            boolean found = false;
            for (int neighbor : graph.get(i)) {
                if (dist[neighbor] == dist[i] - 1) {
                    signpost[i] = neighbor;
                    found = true;
                    break;
                }
            }
            if (!found) {
                possible = false;
                break;
            }
        }

        if (!possible) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
            for (int i = 2; i <= N; i++) {
                System.out.println(signpost[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            graph.get(a).add(b);
            graph.get(b).add(a);
        }

        int[] dist = new int[N + 1];
        Arrays.fill(dist, -1);
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);
        dist[1] = 0;

        while (!queue.isEmpty()) {
            int curr = queue.poll();
            for (int next : graph.get(curr)) {
                if (dist[next] == -1) {
                    dist[next] = dist[curr] + 1;
                    queue.offer(next);
                }
            }
        }

        int[] signpost = new int[N + 1];
        boolean possible = true;

        for (int i = 2; i <= N; i++) {
            boolean found = false;
            for (int neighbor : graph.get(i)) {
                if (dist[neighbor] == dist[i] - 1) {
                    signpost[i] = neighbor;
                    found = true;
                    break;
                }
            }
            if (!found) {
                possible = false;
                break;
            }
        }

        if (!possible) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
            for (int i = 2; i <= N; i++) {
                System.out.println(signpost[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            graph.get(a).add(b);
            graph.get(b).add(a);
        }

        int[] dist = new int[N + 1];
        Arrays.fill(dist, -1);
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);
        dist[1] = 0;

        while (!queue.isEmpty()) {
            int curr = queue.poll();
            for (int next : graph.get(curr)) {
                if (dist[next] == -1) {
                    dist[next] = dist[curr] + 1;
                    queue.offer(next);
                }
            }
        }

        int[] signpost = new int[N + 1];
        boolean possible = true;

        for (int i = 2; i <= N; i++) {
            boolean found = false;
            for (int neighbor : graph.get(i)) {
                if (dist[neighbor] == dist[i] - 1) {
                    signpost[i] = neighbor;
                    found = true;
                    break;
                }
            }
            if (!found) {
                possible = false;
                break;
            }
        }

        if (!possible) {
            System.out.println("No");
        } else {
            System.out.println("Yes");
            for (int i = 2; i <= N; i++) {
                System.out.println(signpost[i]);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        if (T.startsWith(S) && T.length() == S.length() + 1) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();
        if (T.startsWith(S) && T.length() == S.length() + 1) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        if (T.startsWith(S) && T.length() == S.length() + 1) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        if (T.startsWith(S) && T.length() == S.length() + 1) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        long K = sc.nextLong();

        int[] A = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }

        Map<Integer, Integer> visited = new HashMap<>();
        List<Integer> path = new ArrayList<>();

        int current = 1;
        int step = 0;

        while (!visited.containsKey(current)) {
            visited.put(current, step);
            path.add(current);
            current = A[current];
            step++;
        }

        int cycleStart = visited.get(current);
        int cycleLength = step - cycleStart;

        if (K < cycleStart) {
            System.out.println(path.get((int)K));
        } else {
            long remaining = (K - cycleStart) % cycleLength;
            System.out.println(path.get((int)(cycleStart + remaining)));
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        long K = sc.nextLong();

        int[] A = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }

        Map<Integer, Integer> visited = new HashMap<>();
        List<Integer> path = new ArrayList<>();

        int current = 1;
        int step = 0;

        while (!visited.containsKey(current)) {
            visited.put(current, step);
            path.add(current);
            current = A[current];
            step++;
        }

        int cycleStart = visited.get(current);
        int cycleLength = step - cycleStart;

        if (K < cycleStart) {
            System.out.println(path.get((int)K));
        } else {
            long remaining = (K - cycleStart) % cycleLength;
            System.out.println(path.get((int)(cycleStart + remaining)));
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.equals("ABC")) {
            System.out.println("ARC");
        } else {
            System.out.println("ABC");
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        boolean[] hasSnack = new boolean[N + 1];

        for (int i = 0; i < K; i++) {
            int d = sc.nextInt();
            for (int j = 0; j < d; j++) {
                int snuke = sc.nextInt();
                hasSnack[snuke] = true;
            }
        }

        int victims = 0;
        for (int i = 1; i <= N; i++) {
            if (!hasSnack[i]) {
                victims++;
            }
        }

        System.out.println(victims);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        boolean[] hasSnack = new boolean[N + 1];

        for (int i = 0; i < K; i++) {
            int d = sc.nextInt();
            for (int j = 0; j < d; j++) {
                int snuke = sc.nextInt();
                hasSnack[snuke] = true;
            }
        }

        int victims = 0;
        for (int i = 1; i <= N; i++) {
            if (!hasSnack[i]) {
                victims++;
            }
        }

        System.out.println(victims);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        boolean[] hasSnack = new boolean[N + 1];

        for (int i = 0; i < K; i++) {
            int d = sc.nextInt();
            for (int j = 0; j < d; j++) {
                int snuke = sc.nextInt();
                hasSnack[snuke] = true;
            }
        }

        int victims = 0;
        for (int i = 1; i <= N; i++) {
            if (!hasSnack[i]) {
                victims++;
            }
        }

        System.out.println(victims);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] H = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            H[i] = sc.nextInt();
        }

        List<List<Integer>> adj = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            adj.get(b).add(a);
        }

        int goodCount = 0;
        for (int i = 1; i <= N; i++) {
            boolean isGood = true;
            for (int neighbor : adj.get(i)) {
                if (H[i] <= H[neighbor]) {
                    isGood = false;
                    break;
                }
            }
            if (isGood) {
                goodCount++;
            }
        }

        System.out.println(goodCount);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] H = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            H[i] = sc.nextInt();
        }

        List<List<Integer>> adj = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            adj.get(b).add(a);
        }

        int goodCount = 0;

        for (int i = 1; i <= N; i++) {
            boolean isGood = true;

            for (int neighbor : adj.get(i)) {
                if (H[i] <= H[neighbor]) {
                    isGood = false;
                    break;
                }
            }

            if (isGood) {
                goodCount++;
            }
        }

        System.out.println(goodCount);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] H = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            H[i] = sc.nextInt();
        }

        List<List<Integer>> adj = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            adj.get(b).add(a);
        }

        int count = 0;
        for (int i = 1; i <= N; i++) {
            boolean isGood = true;
            for (int neighbor : adj.get(i)) {
                if (H[i] <= H[neighbor]) {
                    isGood = false;
                    break;
                }
            }
            if (isGood) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] H = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            H[i] = sc.nextInt();
        }

        List<List<Integer>> adj = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < M; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            adj.get(b).add(a);
        }

        int count = 0;
        for (int i = 1; i <= N; i++) {
            boolean isGood = true;
            for (int neighbor : adj.get(i)) {
                if (H[i] <= H[neighbor]) {
                    isGood = false;
                    break;
                }
            }
            if (isGood) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<Long, Integer> count = new HashMap<>();

        for (int i = 1; i <= n; i++) {
            long a = sc.nextLong();
            long transformed = i + a;
            count.put(transformed, count.getOrDefault(transformed, 0) + 1);
        }

        long result = 0;
        for (int freq : count.values()) {
            result += (long) freq * (freq - 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<Long, Integer> count = new HashMap<>();

        for (int i = 1; i <= n; i++) {
            long a = sc.nextLong();
            long transformed = i + a;
            count.put(transformed, count.getOrDefault(transformed, 0) + 1);
        }

        long result = 0;
        for (int freq : count.values()) {
            result += (long) freq * (freq - 1) / 2;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();

        int start = ((A + K - 1) / K) * K;

        if (start <= B) {
            System.out.println("OK");
        } else {
            System.out.println("NG");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();

        int start = ((A + K - 1) / K) * K;

        if (start <= B) {
            System.out.println("OK");
        } else {
            System.out.println("NG");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();

        int start = ((A + K - 1) / K) * K;

        if (start <= B) {
            System.out.println("OK");
        } else {
            System.out.println("NG");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long balance = 100;
        int years = 0;

        while (balance < X) {
            balance = balance + balance / 100;
            years++;
        }

        System.out.println(years);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long balance = 100;
        int years = 0;

        while (balance < X) {
            balance = balance + balance / 100;
            years++;
        }

        System.out.println(years);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();
        long balance = 100;
        int years = 0;
        while (balance < X) {
            balance = balance + balance / 100;
            years++;
        }
        System.out.println(years);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long balance = 100;
        int years = 0;

        while (balance < X) {
            balance = balance + balance / 100;
            years++;
        }

        System.out.println(years);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();
        int W = sc.nextInt();

        if (W >= S) {
            System.out.println("unsafe");
        } else {
            System.out.println("safe");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();
        int W = sc.nextInt();
        if (W >= S) {
            System.out.println("unsafe");
        } else {
            System.out.println("safe");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();
        int W = sc.nextInt();
        if (W >= S) {
            System.out.println("unsafe");
        } else {
            System.out.println("safe");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();
        int W = sc.nextInt();

        if (W >= S) {
            System.out.println("unsafe");
        } else {
            System.out.println("safe");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;

        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int takahashiTurns = (C + B - 1) / B;
        int aokiTurns = (A + D - 1) / D;

        if (takahashiTurns <= aokiTurns) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Set<String> items = new HashSet<>();

        for (int i = 0; i < n; i++) {
            items.add(sc.next());
        }

        System.out.println(items.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Set<String> items = new HashSet<>();

        for (int i = 0; i < n; i++) {
            items.add(sc.next());
        }

        System.out.println(items.size());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int R = sc.nextInt();
        double circumference = 2 * Math.PI * R;
        System.out.println(circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int totalAssignmentDays = 0;
        for (int i = 0; i < M; i++) {
            totalAssignmentDays += sc.nextInt();
        }

        if (totalAssignmentDays > N) {
            System.out.println(-1);
        } else {
            System.out.println(N - totalAssignmentDays);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int totalAssignmentDays = 0;
        for (int i = 0; i < M; i++) {
            totalAssignmentDays += sc.nextInt();
        }

        if (totalAssignmentDays > N) {
            System.out.println(-1);
        } else {
            System.out.println(N - totalAssignmentDays);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int totalAssignmentDays = 0;
        for (int i = 0; i < M; i++) {
            totalAssignmentDays += sc.nextInt();
        }

        if (totalAssignmentDays > N) {
            System.out.println(-1);
        } else {
            System.out.println(N - totalAssignmentDays);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int totalAssignmentDays = 0;
        for (int i = 0; i < M; i++) {
            totalAssignmentDays += sc.nextInt();
        }

        if (totalAssignmentDays > N) {
            System.out.println(-1);
        } else {
            System.out.println(N - totalAssignmentDays);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int totalAssignmentDays = 0;
        for (int i = 0; i < M; i++) {
            totalAssignmentDays += sc.nextInt();
        }

        if (totalAssignmentDays > N) {
            System.out.println(-1);
        } else {
            System.out.println(N - totalAssignmentDays);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] subordinates = new int[n + 1];

        for (int i = 2; i <= n; i++) {
            int boss = sc.nextInt();
            subordinates[boss]++;
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(subordinates[i]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] subordinates = new int[n + 1];

        for (int i = 2; i <= n; i++) {
            int boss = sc.nextInt();
            subordinates[boss]++;
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(subordinates[i]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] subordinates = new int[n + 1];

        for (int i = 2; i <= n; i++) {
            int boss = sc.nextInt();
            subordinates[boss]++;
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(subordinates[i]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        if (n.contains("7")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        if (n.contains("7")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        if (n.contains("7")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        if (n.contains("7")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long sum = 0;
        for (int i = 1; i <= N; i++) {
            if (i % 15 == 0) {
            } else if (i % 3 == 0) {
            } else if (i % 5 == 0) {
            } else {
                sum += i;
            }
        }

        System.out.println(sum);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long sum = 0;
        for (int i = 1; i <= N; i++) {
            if (i % 15 == 0) {
            } else if (i % 3 == 0) {
            } else if (i % 5 == 0) {
            } else {
                sum += i;
            }
        }

        System.out.println(sum);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        long sum = 0;
        for (int a = 1; a <= K; a++) {
            for (int b = 1; b <= K; b++) {
                for (int c = 1; c <= K; c++) {
                    sum += gcd(gcd(a, b), c);
                }
            }
        }

        System.out.println(sum);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        long sum = 0;

        for (int a = 1; a <= K; a++) {
            for (int b = 1; b <= K; b++) {
                for (int c = 1; c <= K; c++) {
                    sum += gcd(gcd(a, b), c);
                }
            }
        }

        System.out.println(sum);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        long sum = 0;

        for (int a = 1; a <= K; a++) {
            for (int b = 1; b <= K; b++) {
                for (int c = 1; c <= K; c++) {
                    sum += gcd(gcd(a, b), c);
                }
            }
        }

        System.out.println(sum);
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        int count = 0;

        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                for (int k = j + 1; k < N; k++) {
                    char ci = S.charAt(i);
                    char cj = S.charAt(j);
                    char ck = S.charAt(k);

                    if (ci != cj && ci != ck && cj != ck) {
                        if ((j - i) != (k - j)) {
                            count++;
                        }
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        int count = 0;

        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                for (int k = j + 1; k < N; k++) {
                    char ci = S.charAt(i);
                    char cj = S.charAt(j);
                    char ck = S.charAt(k);

                    if (ci != cj && ci != ck && cj != ck) {
                        if ((j - i) != (k - j)) {
                            count++;
                        }
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        int target = n / 2;

        long[][][] dp = new long[n + 1][target + 1][2];

        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= target; j++) {
                dp[i][j][0] = dp[i][j][1] = Long.MIN_VALUE / 2;
            }
        }

        dp[0][0][0] = 0;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= target; j++) {
                if (dp[i][j][0] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][0]);
                }
                if (dp[i][j][1] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][1]);
                }

                if (j < target && dp[i][j][0] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j + 1][1] = Math.max(dp[i + 1][j + 1][1], dp[i][j][0] + a[i]);
                }
            }
        }

        long result = Math.max(dp[n][target][0], dp[n][target][1]);
        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        int target = n / 2;

        long[][][] dp = new long[n + 1][target + 1][2];

        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= target; j++) {
                dp[i][j][0] = dp[i][j][1] = Long.MIN_VALUE / 2;
            }
        }

        dp[0][0][0] = 0;

        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= target; j++) {
                if (dp[i][j][0] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][0]);
                }
                if (dp[i][j][1] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j][0] = Math.max(dp[i + 1][j][0], dp[i][j][1]);
                }

                if (j < target && dp[i][j][0] != Long.MIN_VALUE / 2) {
                    dp[i + 1][j + 1][1] = Math.max(dp[i + 1][j + 1][1], dp[i][j][0] + a[i]);
                }
            }
        }

        long result = Math.max(dp[n][target][0], dp[n][target][1]);
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();

        System.out.println(Z + " " + X + " " + Y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();
        System.out.println(Z + " " + X + " " + Y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();

        System.out.println(Z + " " + X + " " + Y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();

        int A = X, B = Y, C = Z;

        int temp = A;
        A = B;
        B = temp;

        temp = A;
        A = C;
        C = temp;

        System.out.println(A + " " + B + " " + C);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();

        int A = X, B = Y, C = Z;

        int temp = A;
        A = B;
        B = temp;

        temp = A;
        A = C;
        C = temp;

        System.out.println(A + " " + B + " " + C);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int Z = sc.nextInt();

        int A = X, B = Y, C = Z;

        int temp = A;
        A = B;
        B = temp;

        temp = A;
        A = C;
        C = temp;

        System.out.println(A + " " + B + " " + C);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(2) == s.charAt(3) && s.charAt(4) == s.charAt(5)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(2) == s.charAt(3) && s.charAt(4) == s.charAt(5)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(2) == s.charAt(3) && s.charAt(4) == s.charAt(5)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(2) == s.charAt(3) && s.charAt(4) == s.charAt(5)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(2) == s.charAt(3) && s.charAt(4) == s.charAt(5)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long coins500 = X / 500;
        long remaining = X % 500;
        long coins5 = remaining / 5;

        long happiness = coins500 * 1000 + coins5 * 5;

        System.out.println(happiness);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long coins500 = X / 500;
        long remaining = X % 500;

        long coins5 = remaining / 5;

        long happiness = coins500 * 1000 + coins5 * 5;

        System.out.println(happiness);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();

        long coins500 = X / 500;
        long remaining = X % 500;
        long coins5 = remaining / 5;

        long happiness = coins500 * 1000 + coins5 * 5;

        System.out.println(happiness);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int N = sc.nextInt();
        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int maxGap = 0;

        for (int i = 0; i < N - 1; i++) {
            maxGap = Math.max(maxGap, A[i + 1] - A[i]);
        }

        maxGap = Math.max(maxGap, K - A[N - 1] + A[0]);

        System.out.println(K - maxGap);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int N = sc.nextInt();
        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int maxGap = 0;

        for (int i = 0; i < N - 1; i++) {
            maxGap = Math.max(maxGap, A[i + 1] - A[i]);
        }

        maxGap = Math.max(maxGap, K - A[N - 1] + A[0]);

        System.out.println(K - maxGap);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int N = sc.nextInt();
        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int maxGap = 0;

        for (int i = 0; i < N - 1; i++) {
            maxGap = Math.max(maxGap, A[i + 1] - A[i]);
        }

        maxGap = Math.max(maxGap, K - A[N - 1] + A[0]);

        System.out.println(K - maxGap);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int N = sc.nextInt();

        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int maxGap = 0;

        for (int i = 0; i < N - 1; i++) {
            maxGap = Math.max(maxGap, A[i + 1] - A[i]);
        }

        maxGap = Math.max(maxGap, K - A[N - 1] + A[0]);

        System.out.println(K - maxGap);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int Y = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 1; i < N; i++) {
            graph.get(i).add(i + 1);
            graph.get(i + 1).add(i);
        }

        graph.get(X).add(Y);
        graph.get(Y).add(X);

        int[] count = new int[N];

        for (int i = 1; i <= N; i++) {
            int[] dist = new int[N + 1];
            Arrays.fill(dist, -1);
            Queue<Integer> queue = new LinkedList<>();
            queue.offer(i);
            dist[i] = 0;

            while (!queue.isEmpty()) {
                int v = queue.poll();
                for (int next : graph.get(v)) {
                    if (dist[next] == -1) {
                        dist[next] = dist[v] + 1;
                        queue.offer(next);
                    }
                }
            }

            for (int j = i + 1; j <= N; j++) {
                if (dist[j] > 0 && dist[j] < N) {
                    count[dist[j]]++;
                }
            }
        }

        for (int k = 1; k < N; k++) {
            System.out.println(count[k]);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int Y = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 1; i < N; i++) {
            graph.get(i).add(i + 1);
            graph.get(i + 1).add(i);
        }

        graph.get(X).add(Y);
        graph.get(Y).add(X);

        int[] count = new int[N];

        for (int i = 1; i <= N; i++) {
            int[] dist = new int[N + 1];
            Arrays.fill(dist, -1);
            Queue<Integer> queue = new LinkedList<>();
            queue.offer(i);
            dist[i] = 0;

            while (!queue.isEmpty()) {
                int v = queue.poll();
                for (int next : graph.get(v)) {
                    if (dist[next] == -1) {
                        dist[next] = dist[v] + 1;
                        queue.offer(next);
                    }
                }
            }

            for (int j = i + 1; j <= N; j++) {
                if (dist[j] > 0 && dist[j] < N) {
                    count[dist[j]]++;
                }
            }
        }

        for (int k = 1; k < N; k++) {
            System.out.println(count[k]);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int Y = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 1; i < N; i++) {
            graph.get(i).add(i + 1);
            graph.get(i + 1).add(i);
        }

        graph.get(X).add(Y);
        graph.get(Y).add(X);

        int[] count = new int[N];

        for (int i = 1; i <= N; i++) {
            int[] dist = new int[N + 1];
            Arrays.fill(dist, -1);
            Queue<Integer> queue = new LinkedList<>();
            queue.offer(i);
            dist[i] = 0;

            while (!queue.isEmpty()) {
                int v = queue.poll();
                for (int next : graph.get(v)) {
                    if (dist[next] == -1) {
                        dist[next] = dist[v] + 1;
                        queue.offer(next);
                    }
                }
            }

            for (int j = i + 1; j <= N; j++) {
                if (dist[j] > 0 && dist[j] < N) {
                    count[dist[j]]++;
                }
            }
        }

        for (int k = 1; k < N; k++) {
            System.out.println(count[k]);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int X = sc.nextInt();
        int Y = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        Integer[] p = new Integer[A];
        Integer[] q = new Integer[B];
        Integer[] r = new Integer[C];

        for (int i = 0; i < A; i++) {
            p[i] = sc.nextInt();
        }
        for (int i = 0; i < B; i++) {
            q[i] = sc.nextInt();
        }
        for (int i = 0; i < C; i++) {
            r[i] = sc.nextInt();
        }

        Arrays.sort(p, Collections.reverseOrder());
        Arrays.sort(q, Collections.reverseOrder());
        Arrays.sort(r, Collections.reverseOrder());

        long maxSum = 0;

        for (int redColorless = 0; redColorless <= C; redColorless++) {
            int greenColorless = C - redColorless;

            if (A + redColorless < X || B + greenColorless < Y) {
                continue;
            }

            long sum = 0;

            List<Integer> redApples = new ArrayList<>();
            for (int i = 0; i < A; i++) {
                redApples.add(p[i]);
            }
            for (int i = 0; i < redColorless; i++) {
                redApples.add(r[i]);
            }
            redApples.sort(Collections.reverseOrder());
            for (int i = 0; i < X; i++) {
                sum += redApples.get(i);
            }

            List<Integer> greenApples = new ArrayList<>();
            for (int i = 0; i < B; i++) {
                greenApples.add(q[i]);
            }
            for (int i = redColorless; i < C; i++) {
                greenApples.add(r[i]);
            }
            greenApples.sort(Collections.reverseOrder());
            for (int i = 0; i < Y; i++) {
                sum += greenApples.get(i);
            }

            maxSum = Math.max(maxSum, sum);
        }

        System.out.println(maxSum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int X = sc.nextInt();
        int Y = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        Integer[] p = new Integer[A];
        Integer[] q = new Integer[B];
        Integer[] r = new Integer[C];

        for (int i = 0; i < A; i++) {
            p[i] = sc.nextInt();
        }
        for (int i = 0; i < B; i++) {
            q[i] = sc.nextInt();
        }
        for (int i = 0; i < C; i++) {
            r[i] = sc.nextInt();
        }

        Arrays.sort(p, Collections.reverseOrder());
        Arrays.sort(q, Collections.reverseOrder());
        Arrays.sort(r, Collections.reverseOrder());

        long maxSum = 0;

        for (int redColorless = 0; redColorless <= C; redColorless++) {
            int greenColorless = C - redColorless;

            if (A + redColorless < X || B + greenColorless < Y) {
                continue;
            }

            long sum = 0;

            List<Integer> redApples = new ArrayList<>();
            for (int i = 0; i < A; i++) {
                redApples.add(p[i]);
            }
            for (int i = 0; i < redColorless; i++) {
                redApples.add(r[i]);
            }
            redApples.sort(Collections.reverseOrder());

            for (int i = 0; i < X; i++) {
                sum += redApples.get(i);
            }

            List<Integer> greenApples = new ArrayList<>();
            for (int i = 0; i < B; i++) {
                greenApples.add(q[i]);
            }
            for (int i = redColorless; i < C; i++) {
                greenApples.add(r[i]);
            }
            greenApples.sort(Collections.reverseOrder());

            for (int i = 0; i < Y; i++) {
                sum += greenApples.get(i);
            }

            maxSum = Math.max(maxSum, sum);
        }

        System.out.println(maxSum);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int evenPairs = N * (N - 1) / 2;

        int oddPairs = M * (M - 1) / 2;

        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int evenPairs = N * (N - 1) / 2;
        int oddPairs = M * (M - 1) / 2;

        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int evenPairs = N * (N - 1) / 2;
        int oddPairs = M * (M - 1) / 2;
        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int evenPairs = N * (N - 1) / 2;
        int oddPairs = M * (M - 1) / 2;

        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int evenPairs = N * (N - 1) / 2;
        int oddPairs = M * (M - 1) / 2;
        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int evenPairs = N * (N - 1) / 2;
        int oddPairs = M * (M - 1) / 2;
        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int evenPairs = N * (N - 1) / 2;

        int oddPairs = M * (M - 1) / 2;

        System.out.println(evenPairs + oddPairs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int result = N * (N - 1) / 2 + M * (M - 1) / 2;
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int result = N * (N - 1) / 2 + M * (M - 1) / 2;

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.charAt(i) - '0';
        }

        for (int level = 2; level <= n; level++) {
            for (int j = 0; j < n + 1 - level; j++) {
                arr[j] = Math.abs(arr[j] - arr[j + 1]);
            }
        }

        System.out.println(arr[0]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = s.charAt(i) - '0';
        }

        for (int level = 2; level <= n; level++) {
            for (int j = 0; j < n + 1 - level; j++) {
                arr[j] = Math.abs(arr[j] - arr[j + 1]);
            }
        }

        System.out.println(arr[0]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();

        long diff = c - a - b;

        if (diff <= 0) {
            System.out.println("No");
        } else {
            long left = 4 * a * b;
            long right = diff * diff;

            if (left < right) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();

        long diff = c - a - b;

        if (diff <= 0) {
            System.out.println("No");
        } else {
            long left = 4 * a * b;
            long right = diff * diff;

            if (left < right) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();

        long diff = c - a - b;

        if (diff <= 0) {
            System.out.println("No");
        } else {
            long left = 4 * a * b;
            long right = diff * diff;

            if (left < right) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.length() % 2 == 0 && s.matches("(hi)+")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.length() % 2 == 0 && s.matches("(hi)+")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.length() % 2 == 0 && s.matches("(hi)+")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.length() % 2 == 0 && s.matches("(hi)+")) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long A = sc.nextLong();
        long B = sc.nextLong();

        long cycleLength = A + B;
        long completeCycles = N / cycleLength;
        long remainder = N % cycleLength;

        long blueBalls = completeCycles * A;

        if (remainder > 0) {
            blueBalls += Math.min(remainder, A);
        }

        System.out.println(blueBalls);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long A = sc.nextLong();
        long B = sc.nextLong();

        long cycleLength = A + B;
        long completeCycles = N / cycleLength;
        long remainder = N % cycleLength;

        long blueBalls = completeCycles * A;

        if (remainder > 0) {
            blueBalls += Math.min(remainder, A);
        }

        System.out.println(blueBalls);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long A = sc.nextLong();
        long B = sc.nextLong();

        long cycleLength = A + B;
        long completeCycles = N / cycleLength;
        long remainder = N % cycleLength;

        long blueBalls = completeCycles * A;

        if (remainder > 0) {
            blueBalls += Math.min(remainder, A);
        }

        System.out.println(blueBalls);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        double min1 = A / 0.08;
        double max1 = (A + 1) / 0.08;

        double min2 = B / 0.10;
        double max2 = (B + 1) / 0.10;

        double minP = Math.max(min1, min2);
        double maxP = Math.min(max1, max2);

        if (minP >= maxP) {
            System.out.println(-1);
            return;
        }

        int candidate = (int) Math.ceil(minP);

        if (candidate < maxP &&
            (int)(candidate * 0.08) == A &&
            (int)(candidate * 0.10) == B) {
            System.out.println(candidate);
        } else {
            System.out.println(-1);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        double min1 = A / 0.08;
        double max1 = (A + 1) / 0.08;

        double min2 = B / 0.10;
        double max2 = (B + 1) / 0.10;

        double minP = Math.max(min1, min2);
        double maxP = Math.min(max1, max2);

        if (minP >= maxP) {
            System.out.println(-1);
            return;
        }

        int candidate = (int) Math.ceil(minP);

        if (candidate < maxP &&
            (int)(candidate * 0.08) == A &&
            (int)(candidate * 0.10) == B) {
            System.out.println(candidate);
        } else {
            System.out.println(-1);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        double min1 = A / 0.08;
        double max1 = (A + 1) / 0.08;

        double min2 = B / 0.10;
        double max2 = (B + 1) / 0.10;

        double minP = Math.max(min1, min2);
        double maxP = Math.min(max1, max2);

        if (minP >= maxP) {
            System.out.println(-1);
            return;
        }

        int candidate = (int) Math.ceil(minP);

        if (candidate < maxP &&
            (int)(candidate * 0.08) == A &&
            (int)(candidate * 0.10) == B) {
            System.out.println(candidate);
        } else {
            System.out.println(-1);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int P = sc.nextInt();
        String S = sc.next();

        long count = 0;

        for (int i = 0; i < N; i++) {
            int remainder = 0;
            for (int j = i; j < N; j++) {
                int digit = S.charAt(j) - '0';
                remainder = (remainder * 10 + digit) % P;
                if (remainder == 0) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int P = sc.nextInt();
        String S = sc.next();

        long count = 0;

        for (int i = 0; i < N; i++) {
            int remainder = 0;
            for (int j = i; j < N; j++) {
                int digit = S.charAt(j) - '0';
                remainder = (remainder * 10 + digit) % P;
                if (remainder == 0) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int P = sc.nextInt();
        String S = sc.next();

        long count = 0;

        for (int i = 0; i < N; i++) {
            int remainder = 0;
            for (int j = i; j < N; j++) {
                int digit = S.charAt(j) - '0';
                remainder = (remainder * 10 + digit) % P;
                if (remainder == 0) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int sheets = (N + 1) / 2;

        System.out.println(sheets);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int sheets = (N + 1) / 2;

        System.out.println(sheets);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int sheets = (N + 1) / 2;

        System.out.println(sheets);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] digits = new int[N];
        Arrays.fill(digits, -1);

        for (int i = 0; i < M; i++) {
            int pos = sc.nextInt() - 1;
            int digit = sc.nextInt();

            if (digits[pos] != -1 && digits[pos] != digit) {
                System.out.println(-1);
                return;
            }
            digits[pos] = digit;
        }

        if (N > 1 && digits[0] == 0) {
            System.out.println(-1);
            return;
        }

        for (int i = 0; i < N; i++) {
            if (digits[i] == -1) {
                if (i == 0 && N > 1) {
                    digits[i] = 1;
                } else {
                    digits[i] = 0;
                }
            }
        }

        long result = 0;
        for (int i = 0; i < N; i++) {
            result = result * 10 + digits[i];
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] digits = new int[N];
        Arrays.fill(digits, -1);

        for (int i = 0; i < M; i++) {
            int pos = sc.nextInt() - 1;
            int digit = sc.nextInt();

            if (digits[pos] != -1 && digits[pos] != digit) {
                System.out.println(-1);
                return;
            }
            digits[pos] = digit;
        }

        if (N > 1 && digits[0] == 0) {
            System.out.println(-1);
            return;
        }

        for (int i = 0; i < N; i++) {
            if (digits[i] == -1) {
                if (i == 0 && N > 1) {
                    digits[i] = 1;
                } else {
                    digits[i] = 0;
                }
            }
        }

        long result = 0;
        for (int i = 0; i < N; i++) {
            result = result * 10 + digits[i];
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();

        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }

        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();

        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }

        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();
        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }
        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();

        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }

        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();

        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }

        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();
        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }
        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();

        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }

        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int R = sc.nextInt();
        int innerRating;
        if (N >= 10) {
            innerRating = R;
        } else {
            innerRating = R + 100 * (10 - N);
        }
        System.out.println(innerRating);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int digits = (int)(Math.log(N) / Math.log(K)) + 1;

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int digits = (int)(Math.log(N) / Math.log(K)) + 1;

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int digits = 0;
        while (N > 0) {
            N /= K;
            digits++;
        }

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int digits = 0;

        while (N > 0) {
            N /= K;
            digits++;
        }

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int digits = 0;

        while (N > 0) {
            N /= K;
            digits++;
        }

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int digits = 0;
        while (N > 0) {
            N /= K;
            digits++;
        }

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int digits = 0;
        while (N > 0) {
            N /= K;
            digits++;
        }

        System.out.println(digits);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        if ((A == B && A != C) || (A == C && A != B) || (B == C && B != A)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        boolean approved = true;
        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (num % 2 == 0 && num % 3 != 0 && num % 5 != 0) {
                approved = false;
                break;
            }
        }

        System.out.println(approved ? "APPROVED" : "DENIED");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        boolean approved = true;
        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (num % 2 == 0 && num % 3 != 0 && num % 5 != 0) {
                approved = false;
                break;
            }
        }

        System.out.println(approved ? "APPROVED" : "DENIED");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        boolean approved = true;
        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (num % 2 == 0 && num % 3 != 0 && num % 5 != 0) {
                approved = false;
                break;
            }
        }

        System.out.println(approved ? "APPROVED" : "DENIED");
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> count = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String s = sc.next();
            count.put(s, count.getOrDefault(s, 0) + 1);
        }

        int maxCount = Collections.max(count.values());

        List<String> result = new ArrayList<>();
        for (Map.Entry<String, Integer> entry : count.entrySet()) {
            if (entry.getValue() == maxCount) {
                result.add(entry.getKey());
            }
        }

        Collections.sort(result);

        for (String s : result) {
            System.out.println(s);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> count = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String s = sc.next();
            count.put(s, count.getOrDefault(s, 0) + 1);
        }

        int maxCount = Collections.max(count.values());

        List<String> result = new ArrayList<>();
        for (Map.Entry<String, Integer> entry : count.entrySet()) {
            if (entry.getValue() == maxCount) {
                result.add(entry.getKey());
            }
        }

        Collections.sort(result);

        for (String s : result) {
            System.out.println(s);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> count = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String s = sc.next();
            count.put(s, count.getOrDefault(s, 0) + 1);
        }

        int maxCount = Collections.max(count.values());

        List<String> result = new ArrayList<>();
        for (Map.Entry<String, Integer> entry : count.entrySet()) {
            if (entry.getValue() == maxCount) {
                result.add(entry.getKey());
            }
        }

        Collections.sort(result);

        for (String s : result) {
            System.out.println(s);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }
        System.out.println(A + " " + B);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.next();
        String T = sc.next();
        int A = sc.nextInt();
        int B = sc.nextInt();
        String U = sc.next();

        if (U.equals(S)) {
            A--;
        } else {
            B--;
        }

        System.out.println(A + " " + B);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        String result = "x".repeat(s.length());
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        String result = "x".repeat(s.length());
        System.out.println(result);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Set<Integer> seen = new HashSet<>();

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            if (!seen.add(a)) {
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Set<Integer> seen = new HashSet<>();

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            if (!seen.add(a)) {
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        Arrays.sort(arr);

        for (int i = 1; i < n; i++) {
            if (arr[i] == arr[i-1]) {
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        Arrays.sort(arr);

        for (int i = 1; i < n; i++) {
            if (arr[i] == arr[i-1]) {
                System.out.println("NO");
                return;
            }
        }

        System.out.println("YES");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        double[] expected = new double[N];
        for (int i = 0; i < N; i++) {
            int p = sc.nextInt();
            expected[i] = (1.0 + p) / 2.0;
        }

        double currentSum = 0;
        for (int i = 0; i < K; i++) {
            currentSum += expected[i];
        }

        double maxSum = currentSum;

        for (int i = K; i < N; i++) {
            currentSum = currentSum - expected[i - K] + expected[i];
            maxSum = Math.max(maxSum, currentSum);
        }

        System.out.printf("%.12f\n", maxSum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        double[] expected = new double[N];
        for (int i = 0; i < N; i++) {
            int p = sc.nextInt();
            expected[i] = (1.0 + p) / 2.0;
        }

        double currentSum = 0;
        for (int i = 0; i < K; i++) {
            currentSum += expected[i];
        }

        double maxSum = currentSum;

        for (int i = K; i < N; i++) {
            currentSum = currentSum - expected[i - K] + expected[i];
            maxSum = Math.max(maxSum, currentSum);
        }

        System.out.printf("%.12f\n", maxSum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();

        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();
        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();

        int attacks = (H + A - 1) / A;

        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();
        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();
        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();
        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();

        int attacks = (H + A - 1) / A;

        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();
        int attacks = (H + A - 1) / A;
        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();

        int attacks = 0;
        while (H > 0) {
            H -= A;
            attacks++;
        }

        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int A = sc.nextInt();

        int attacks = 0;
        while (H > 0) {
            H -= A;
            attacks++;
        }

        System.out.println(attacks);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int H = sc.nextInt();
        int N = sc.nextInt();

        long totalDamage = 0;
        for (int i = 0; i < N; i++) {
            totalDamage += sc.nextInt();
        }

        if (totalDamage >= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int H = sc.nextInt();
        int N = sc.nextInt();

        long totalDamage = 0;
        for (int i = 0; i < N; i++) {
            totalDamage += sc.nextInt();
        }

        if (totalDamage >= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int H = sc.nextInt();
        int N = sc.nextInt();

        long totalDamage = 0;
        for (int i = 0; i < N; i++) {
            totalDamage += sc.nextInt();
        }

        if (totalDamage >= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Integer[] H = new Integer[N];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        if (K >= N) {
            System.out.println(0);
            return;
        }

        Arrays.sort(H, Collections.reverseOrder());

        long attacks = 0;
        for (int i = K; i < N; i++) {
            attacks += H[i];
        }

        System.out.println(attacks);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Integer[] H = new Integer[N];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextInt();
        }

        if (K >= N) {
            System.out.println(0);
            return;
        }

        Arrays.sort(H, Collections.reverseOrder());

        long attacks = 0;
        for (int i = K; i < N; i++) {
            attacks += H[i];
        }

        System.out.println(attacks);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] H = new long[N];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
        }

        if (K >= N) {
            System.out.println(0);
            return;
        }

        Arrays.sort(H);

        long attacks = 0;
        for (int i = 0; i < N - K; i++) {
            attacks += H[i];
        }

        System.out.println(attacks);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] H = new long[N];
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
        }

        if (K >= N) {
            System.out.println(0);
            return;
        }

        Arrays.sort(H);

        long attacks = 0;
        for (int i = 0; i < N - K; i++) {
            attacks += H[i];
        }

        System.out.println(attacks);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int N = sc.nextInt();

        int[] A = new int[N];
        int[] B = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
        }

        int[] dp = new int[H + 10001];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 0; i <= H + 10000; i++) {
            if (dp[i] == Integer.MAX_VALUE) continue;

            for (int j = 0; j < N; j++) {
                int nextDamage = i + A[j];
                if (nextDamage < dp.length) {
                    dp[nextDamage] = Math.min(dp[nextDamage], dp[i] + B[j]);
                }
            }
        }

        int result = Integer.MAX_VALUE;
        for (int i = H; i < dp.length; i++) {
            result = Math.min(result, dp[i]);
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int N = sc.nextInt();

        int[] A = new int[N];
        int[] B = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
        }

        int[] dp = new int[H + 10001];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 0; i <= H + 10000; i++) {
            if (dp[i] == Integer.MAX_VALUE) continue;

            for (int j = 0; j < N; j++) {
                int nextDamage = i + A[j];
                if (nextDamage < dp.length) {
                    dp[nextDamage] = Math.min(dp[nextDamage], dp[i] + B[j]);
                }
            }
        }

        int result = Integer.MAX_VALUE;
        for (int i = H; i < dp.length; i++) {
            result = Math.min(result, dp[i]);
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        if (N == M) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] p = new int[n];

        for (int i = 0; i < n; i++) {
            p[i] = sc.nextInt();
        }

        int count = 0;
        int minSoFar = Integer.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            if (p[i] <= minSoFar) {
                count++;
                minSoFar = p[i];
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] p = new int[n];

        for (int i = 0; i < n; i++) {
            p[i] = sc.nextInt();
        }

        int count = 0;
        int minSoFar = Integer.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            if (p[i] <= minSoFar) {
                count++;
                minSoFar = p[i];
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] p = new int[n];

        for (int i = 0; i < n; i++) {
            p[i] = sc.nextInt();
        }

        int count = 0;
        int minSoFar = Integer.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            if (p[i] <= minSoFar) {
                count++;
                minSoFar = p[i];
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    static final int MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long lcm = a[0];
        for (int i = 1; i < n; i++) {
            lcm = lcm(lcm, a[i]);
        }

        long sum = 0;
        for (int i = 0; i < n; i++) {
            sum = (sum + (lcm / a[i]) % MOD) % MOD;
        }

        System.out.println(sum);
    }

    static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static long lcm(long a, long b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.*;

public class Main {
    static final int MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long lcm = a[0];
        for (int i = 1; i < n; i++) {
            lcm = lcm(lcm, a[i]);
        }

        long sum = 0;
        for (int i = 0; i < n; i++) {
            sum = (sum + (lcm / a[i]) % MOD) % MOD;
        }

        System.out.println(sum);
    }

    static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static long lcm(long a, long b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int N = sc.nextInt();

        int minOps = Integer.MAX_VALUE;

        for (int r = 0; r <= H; r++) {
            for (int c = 0; c <= W; c++) {
                int blackSquares = r * W + c * H - r * c;
                if (blackSquares >= N) {
                    minOps = Math.min(minOps, r + c);
                }
            }
        }

        System.out.println(minOps);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int N = sc.nextInt();

        int minOps = Integer.MAX_VALUE;

        for (int r = 0; r <= H; r++) {
            for (int c = 0; c <= W; c++) {
                int blackSquares = r * W + c * H - r * c;
                if (blackSquares >= N) {
                    minOps = Math.min(minOps, r + c);
                }
            }
        }

        System.out.println(minOps);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int N = sc.nextInt();

        int minOps = Integer.MAX_VALUE;

        for (int r = 0; r <= H; r++) {
            for (int c = 0; c <= W; c++) {
                int blackSquares = r * W + c * H - r * c;
                if (blackSquares >= N) {
                    minOps = Math.min(minOps, r + c);
                }
            }
        }

        System.out.println(minOps);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int N = sc.nextInt();

        int minOps = Integer.MAX_VALUE;

        for (int r = 0; r <= H; r++) {
            for (int c = 0; c <= W; c++) {
                int blackSquares = r * W + c * H - r * c;
                if (blackSquares >= N) {
                    minOps = Math.min(minOps, r + c);
                }
            }
        }

        System.out.println(minOps);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int N = sc.nextInt();

        int minOps = Integer.MAX_VALUE;

        for (int r = 0; r <= H; r++) {
            for (int c = 0; c <= W; c++) {
                int blackSquares = r * W + c * H - r * c;

                if (blackSquares >= N) {
                    minOps = Math.min(minOps, r + c);
                }
            }
        }

        System.out.println(minOps);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] intervals = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = sc.nextInt();
            int l = sc.nextInt();
            intervals[i][0] = x - l;
            intervals[i][1] = x + l;
        }

        Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1]));

        int count = 0;
        int lastEnd = Integer.MIN_VALUE;

        for (int[] interval : intervals) {
            if (interval[0] >= lastEnd) {
                count++;
                lastEnd = interval[1];
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] intervals = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = sc.nextInt();
            int l = sc.nextInt();
            intervals[i][0] = x - l;
            intervals[i][1] = x + l;
        }

        Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1]));

        int count = 0;
        int lastEnd = Integer.MIN_VALUE;

        for (int[] interval : intervals) {
            if (interval[0] >= lastEnd) {
                count++;
                lastEnd = interval[1];
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] intervals = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = sc.nextInt();
            int l = sc.nextInt();
            intervals[i][0] = x - l;
            intervals[i][1] = x + l;
        }

        Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1]));

        int count = 0;
        int lastEnd = Integer.MIN_VALUE;

        for (int[] interval : intervals) {
            if (interval[0] >= lastEnd) {
                count++;
                lastEnd = interval[1];
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int S = sc.nextInt();

        int[] A = new int[N];

        for (int i = 0; i < K; i++) {
            A[i] = S;
        }

        for (int i = K; i < N; i++) {
            A[i] = S + 1;
        }

        for (int i = 0; i < N; i++) {
            System.out.print(A[i]);
            if (i < N - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int S = sc.nextInt();

        int[] A = new int[N];

        for (int i = 0; i < K; i++) {
            A[i] = S;
        }

        for (int i = K; i < N; i++) {
            A[i] = S + 1;
        }

        for (int i = 0; i < N; i++) {
            System.out.print(A[i]);
            if (i < N - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        String[] songs = new String[n];
        int[] durations = new int[n];

        for (int i = 0; i < n; i++) {
            songs[i] = sc.next();
            durations[i] = sc.nextInt();
        }

        String x = sc.next();

        int sleepStartIndex = -1;
        for (int i = 0; i < n; i++) {
            if (songs[i].equals(x)) {
                sleepStartIndex = i;
                break;
            }
        }

        int totalDuration = 0;
        for (int i = sleepStartIndex + 1; i < n; i++) {
            totalDuration += durations[i];
        }

        System.out.println(totalDuration);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        String[] songs = new String[n];
        int[] durations = new int[n];

        for (int i = 0; i < n; i++) {
            songs[i] = sc.next();
            durations[i] = sc.nextInt();
        }

        String x = sc.next();

        int sleepStartIndex = -1;
        for (int i = 0; i < n; i++) {
            if (songs[i].equals(x)) {
                sleepStartIndex = i;
                break;
            }
        }

        int totalDuration = 0;
        for (int i = sleepStartIndex + 1; i < n; i++) {
            totalDuration += durations[i];
        }

        System.out.println(totalDuration);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int X = sc.nextInt();

        if (K * 500 >= X) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int X = sc.nextInt();
        if (K * 500 >= X) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int X = sc.nextInt();

        if (K * 500 >= X) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        int X = sc.nextInt();
        if (K * 500 >= X) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        int count = 0;
        for (int i = 0; i <= N - 3; i++) {
            if (S.substring(i, i + 3).equals("ABC")) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        int count = 0;
        for (int i = 0; i <= N - 3; i++) {
            if (S.substring(i, i + 3).equals("ABC")) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        int count = 0;
        for (int i = 0; i <= N - 3; i++) {
            if (S.substring(i, i + 3).equals("ABC")) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        int count = 0;
        for (int i = 0; i <= n - 3; i++) {
            if (s.substring(i, i + 3).equals("ABC")) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        int count = 0;
        for (int i = 0; i <= n - 3; i++) {
            if (s.substring(i, i + 3).equals("ABC")) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        System.out.println(T + S);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();
        long K = sc.nextLong();

        if (K <= A) {
            System.out.println((A - K) + " " + B);
        } else {
            long remaining = K - A;
            long aokiLeft = Math.max(0, B - remaining);
            System.out.println("0 " + aokiLeft);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();
        long K = sc.nextLong();

        if (K <= A) {
            System.out.println((A - K) + " " + B);
        } else {
            long remaining = K - A;
            long aokiLeft = Math.max(0, B - remaining);
            System.out.println("0 " + aokiLeft);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();
        long K = sc.nextLong();

        if (K <= A) {
            System.out.println((A - K) + " " + B);
        } else {
            long remaining = K - A;
            long aokiLeft = Math.max(0, B - remaining);
            System.out.println("0 " + aokiLeft);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        while (!isPrime(X)) {
            X++;
        }

        System.out.println(X);
    }

    static boolean isPrime(int n) {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) return false;
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        while (!isPrime(X)) {
            X++;
        }

        System.out.println(X);
    }

    static boolean isPrime(int n) {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) return false;
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        while (!isPrime(X)) {
            X++;
        }

        System.out.println(X);
    }

    static boolean isPrime(int n) {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) return false;
        }
        return true;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        List<Integer> happiness = new ArrayList<>();

        for (int x = 0; x < N; x++) {
            for (int y = 0; y < N; y++) {
                happiness.add(A[x] + A[y]);
            }
        }

        Collections.sort(happiness, Collections.reverseOrder());

        long totalHappiness = 0;
        for (int i = 0; i < M; i++) {
            totalHappiness += happiness.get(i);
        }

        System.out.println(totalHappiness);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        List<Integer> happiness = new ArrayList<>();

        for (int x = 0; x < N; x++) {
            for (int y = 0; y < N; y++) {
                happiness.add(A[x] + A[y]);
            }
        }

        Collections.sort(happiness, Collections.reverseOrder());

        long totalHappiness = 0;
        for (int i = 0; i < M; i++) {
            totalHappiness += happiness.get(i);
        }

        System.out.println(totalHappiness);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();
        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        List<Integer> happiness = new ArrayList<>();

        for (int x = 0; x < N; x++) {
            for (int y = 0; y < N; y++) {
                happiness.add(A[x] + A[y]);
            }
        }

        Collections.sort(happiness, Collections.reverseOrder());

        long totalHappiness = 0;
        for (int i = 0; i < M; i++) {
            totalHappiness += happiness.get(i);
        }

        System.out.println(totalHappiness);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();

        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        for (int i = 1; i <= 3; i++) {
            if (i != A && i != B) {
                System.out.println(i);
                break;
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();
        String T = sc.next();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < N; i++) {
            result.append(S.charAt(i));
            result.append(T.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();
        String T = sc.next();
        StringBuilder result = new StringBuilder();

        for (int i = 0; i < N; i++) {
            result.append(S.charAt(i));
            result.append(T.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        String t = sc.next();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < n; i++) {
            result.append(s.charAt(i));
            result.append(t.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        String t = sc.next();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < n; i++) {
            result.append(s.charAt(i));
            result.append(t.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        String t = sc.next();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < n; i++) {
            result.append(s.charAt(i)).append(t.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        String t = sc.next();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < n; i++) {
            result.append(s.charAt(i)).append(t.charAt(i));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();

        long lcm = (A * B) / gcd(A, B);
        System.out.println(lcm);
    }

    private static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();

        long lcm = (A * B) / gcd(A, B);
        System.out.println(lcm);
    }

    private static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();

        long lcm = (A * B) / gcd(A, B);
        System.out.println(lcm);
    }

    private static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long A = sc.nextLong();
        long B = sc.nextLong();

        long lcm = (A * B) / gcd(A, B);
        System.out.println(lcm);
    }

    private static long gcd(long a, long b) {
        while (b != 0) {
            long temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A1 = sc.nextInt();
        int A2 = sc.nextInt();
        int A3 = sc.nextInt();

        if (A1 + A2 + A3 >= 22) {
            System.out.println("bust");
        } else {
            System.out.println("win");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A1 = sc.nextInt();
        int A2 = sc.nextInt();
        int A3 = sc.nextInt();

        if (A1 + A2 + A3 >= 22) {
            System.out.println("bust");
        } else {
            System.out.println("win");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int changes = 0;
        int n = s.length();

        for (int i = 0; i < n / 2; i++) {
            if (s.charAt(i) != s.charAt(n - 1 - i)) {
                changes++;
            }
        }

        System.out.println(changes);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int changes = 0;
        int n = s.length();

        for (int i = 0; i < n / 2; i++) {
            if (s.charAt(i) != s.charAt(n - 1 - i)) {
                changes++;
            }
        }

        System.out.println(changes);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int n = s.length();
        int hugs = 0;

        for (int i = 0; i < n / 2; i++) {
            if (s.charAt(i) != s.charAt(n - 1 - i)) {
                hugs++;
            }
        }

        System.out.println(hugs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int n = s.length();
        int hugs = 0;

        for (int i = 0; i < n / 2; i++) {
            if (s.charAt(i) != s.charAt(n - 1 - i)) {
                hugs++;
            }
        }

        System.out.println(hugs);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int n = s.length();
        int hugs = 0;
        for (int i = 0; i < n / 2; i++) {
            if (s.charAt(i) != s.charAt(n - 1 - i)) {
                hugs++;
            }
        }
        System.out.println(hugs);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<int[]>> testimonies = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            testimonies.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            for (int j = 0; j < a; j++) {
                int x = sc.nextInt() - 1;
                int y = sc.nextInt();
                testimonies.get(i).add(new int[]{x, y});
            }
        }

        int maxHonest = 0;

        for (int mask = 0; mask < (1 << n); mask++) {
            boolean valid = true;

            for (int i = 0; i < n && valid; i++) {
                if ((mask & (1 << i)) != 0) {
                    for (int[] testimony : testimonies.get(i)) {
                        int target = testimony[0];
                        int claim = testimony[1];

                        boolean targetIsHonest = (mask & (1 << target)) != 0;
                        if ((claim == 1 && !targetIsHonest) || (claim == 0 && targetIsHonest)) {
                            valid = false;
                            break;
                        }
                    }
                }
            }

            if (valid) {
                maxHonest = Math.max(maxHonest, Integer.bitCount(mask));
            }
        }

        System.out.println(maxHonest);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<int[]>> testimonies = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            testimonies.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            for (int j = 0; j < a; j++) {
                int x = sc.nextInt() - 1;
                int y = sc.nextInt();
                testimonies.get(i).add(new int[]{x, y});
            }
        }

        int maxHonest = 0;

        for (int mask = 0; mask < (1 << n); mask++) {
            boolean valid = true;

            for (int i = 0; i < n && valid; i++) {
                if ((mask & (1 << i)) != 0) {
                    for (int[] testimony : testimonies.get(i)) {
                        int target = testimony[0];
                        int claim = testimony[1];

                        boolean targetIsHonest = (mask & (1 << target)) != 0;
                        if ((claim == 1 && !targetIsHonest) || (claim == 0 && targetIsHonest)) {
                            valid = false;
                            break;
                        }
                    }
                }
            }

            if (valid) {
                maxHonest = Math.max(maxHonest, Integer.bitCount(mask));
            }
        }

        System.out.println(maxHonest);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] A = new int[H][W];
        int[][] B = new int[H][W];

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        Set<Integer>[][] dp = new Set[H][W];
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                dp[i][j] = new HashSet<>();
            }
        }

        dp[0][0].add(A[0][0] - B[0][0]);
        dp[0][0].add(B[0][0] - A[0][0]);

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (i == 0 && j == 0) continue;

                if (i > 0) {
                    for (int diff : dp[i-1][j]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }

                if (j > 0) {
                    for (int diff : dp[i][j-1]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }
            }
        }

        int minUnbalance = Integer.MAX_VALUE;
        for (int diff : dp[H-1][W-1]) {
            minUnbalance = Math.min(minUnbalance, Math.abs(diff));
        }

        System.out.println(minUnbalance);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] A = new int[H][W];
        int[][] B = new int[H][W];

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        Set<Integer>[][] dp = new Set[H][W];
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                dp[i][j] = new HashSet<>();
            }
        }

        dp[0][0].add(A[0][0] - B[0][0]);
        dp[0][0].add(B[0][0] - A[0][0]);

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (i == 0 && j == 0) continue;

                if (i > 0) {
                    for (int diff : dp[i-1][j]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }

                if (j > 0) {
                    for (int diff : dp[i][j-1]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }
            }
        }

        int minUnbalance = Integer.MAX_VALUE;
        for (int diff : dp[H-1][W-1]) {
            minUnbalance = Math.min(minUnbalance, Math.abs(diff));
        }

        System.out.println(minUnbalance);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] A = new int[H][W];
        int[][] B = new int[H][W];

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        Set<Integer>[][] dp = new Set[H][W];

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                dp[i][j] = new HashSet<>();
            }
        }

        dp[0][0].add(A[0][0] - B[0][0]);
        dp[0][0].add(B[0][0] - A[0][0]);

        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if (i == 0 && j == 0) continue;

                if (i > 0) {
                    for (int diff : dp[i-1][j]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }

                if (j > 0) {
                    for (int diff : dp[i][j-1]) {
                        dp[i][j].add(diff + A[i][j] - B[i][j]);
                        dp[i][j].add(diff + B[i][j] - A[i][j]);
                    }
                }
            }
        }

        int minUnbalance = Integer.MAX_VALUE;
        for (int diff : dp[H-1][W-1]) {
            minUnbalance = Math.min(minUnbalance, Math.abs(diff));
        }

        System.out.println(minUnbalance);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M2 > M1) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M2 > M1) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M1 != M2) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M1 != M2) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M1 != M2) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M1 = sc.nextInt();
        int D1 = sc.nextInt();
        int M2 = sc.nextInt();
        int D2 = sc.nextInt();

        if (M1 != M2) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int[] prices = {100, 101, 102, 103, 104, 105};
        boolean[] dp = new boolean[X + 1];
        dp[0] = true;

        for (int price : prices) {
            for (int i = price; i <= X; i++) {
                if (dp[i - price]) {
                    dp[i] = true;
                }
            }
        }

        System.out.println(dp[X] ? 1 : 0);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();

        int[] prices = {100, 101, 102, 103, 104, 105};
        boolean[] dp = new boolean[X + 1];
        dp[0] = true;

        for (int price : prices) {
            for (int i = price; i <= X; i++) {
                if (dp[i - price]) {
                    dp[i] = true;
                }
            }
        }

        System.out.println(dp[X] ? 1 : 0);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        Set<String> pinCodes = new HashSet<>();

        for (int i = 0; i < N - 2; i++) {
            for (int j = i + 1; j < N - 1; j++) {
                for (int k = j + 1; k < N; k++) {
                    String pin = "" + S.charAt(i) + S.charAt(j) + S.charAt(k);
                    pinCodes.add(pin);
                }
            }
        }

        System.out.println(pinCodes.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        Set<String> pinCodes = new HashSet<>();

        for (int i = 0; i < N - 2; i++) {
            for (int j = i + 1; j < N - 1; j++) {
                for (int k = j + 1; k < N; k++) {
                    String pin = "" + S.charAt(i) + S.charAt(j) + S.charAt(k);
                    pinCodes.add(pin);
                }
            }
        }

        System.out.println(pinCodes.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        Set<String> pinCodes = new HashSet<>();

        for (int i = 0; i < n - 2; i++) {
            for (int j = i + 1; j < n - 1; j++) {
                for (int k = j + 1; k < n; k++) {
                    String pin = "" + s.charAt(i) + s.charAt(j) + s.charAt(k);
                    pinCodes.add(pin);
                }
            }
        }

        System.out.println(pinCodes.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        Set<String> pinCodes = new HashSet<>();

        for (int i = 0; i < n - 2; i++) {
            for (int j = i + 1; j < n - 1; j++) {
                for (int k = j + 1; k < n; k++) {
                    String pin = "" + s.charAt(i) + s.charAt(j) + s.charAt(k);
                    pinCodes.add(pin);
                }
            }
        }

        System.out.println(pinCodes.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();

        Set<String> pinCodes = new HashSet<>();

        for (int i = 0; i < n - 2; i++) {
            for (int j = i + 1; j < n - 1; j++) {
                for (int k = j + 1; k < n; k++) {
                    String pin = "" + s.charAt(i) + s.charAt(j) + s.charAt(k);
                    pinCodes.add(pin);
                }
            }
        }

        System.out.println(pinCodes.size());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int days = 0;
        switch(s) {
            case "SUN": days = 7; break;
            case "MON": days = 6; break;
            case "TUE": days = 5; break;
            case "WED": days = 4; break;
            case "THU": days = 3; break;
            case "FRI": days = 2; break;
            case "SAT": days = 1; break;
        }

        System.out.println(days);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int days = 0;
        switch(s) {
            case "SUN": days = 7; break;
            case "MON": days = 6; break;
            case "TUE": days = 5; break;
            case "WED": days = 4; break;
            case "THU": days = 3; break;
            case "FRI": days = 2; break;
            case "SAT": days = 1; break;
        }

        System.out.println(days);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        StringBuilder result = new StringBuilder();

        for (char c : S.toCharArray()) {
            int shifted = ((c - 'A' + N) % 26);
            result.append((char)('A' + shifted));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        StringBuilder result = new StringBuilder();

        for (char c : S.toCharArray()) {
            int shifted = ((c - 'A' + N) % 26);
            result.append((char)('A' + shifted));
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();

        StringBuilder result = new StringBuilder();
        for (char c : S.toCharArray()) {
            int shifted = ((c - 'A' + N) % 26);
            result.append((char)('A' + shifted));
        }

        System.out.println(result.toString());
    }
}